1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define all(x) x.begin(), x.end()
#define CLR(i, a) memset(i, a, sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int)a.size())
#define LOCAL
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef array<ll, 3> arr;
typedef double DB;
typedef pair<DB, DB> pdd;
constexpr ll MAXN = static_cast<ll>(1e6) + 10, INF = static_cast<ll>(5e18) + 3;
ll N, T;
ll pow10[20];
inline void solve() {
ll x;
cin >> x;
ll ans = 9;
string s = to_string(x);
N = SZ(s);
FOR(i, 0, N - 1) {
if (s[i] == '7') {
cout << 0 << '\n';
return;
}
}
FOR(i, 1, N + 1) {
ll add = pow10[i] - 1;
ll t = x;
FOR(j, 1, ans) {
t += add;
string ts = to_string(t);
bool isBreak = false;
FOR(k, 0, SZ(ts) - 1) {
if (ts[k] == '7') {
ans = j;
isBreak = true;
break;
}
}
if (isBreak) break;
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> T;
pow10[0] = 1;
FOR(i, 1, 18) { pow10[i] = pow10[i - 1] * 10; }
while (T--) {
solve();
}
return 0;
}
|
