-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Extremely_Round.cpp
More file actions
67 lines (62 loc) · 1.3 KB
/
Copy pathA_Extremely_Round.cpp
File metadata and controls
67 lines (62 loc) · 1.3 KB
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
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> vpl;
typedef set<ll> sll;
typedef map<ll, ll> mll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
double pi = acos(-1.0);
#define debug(x) cerr << #x < < < < x << endl;
#define loop for (ll i = 1; i <= n; i++)
#define all(a) (a).begin(), (a).end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)));
#define max4(a, b, c, d) max(a, max(b, max(c, d)));
bool check(int x)
{
string s = to_string(x);
int count = 0;
for (int i = 0; i < s.size(); i++)
{
if (s[i] != '0')
count++;
}
if (count != 1)
return false;
else
return true;
}
int main()
{
int t, ans;
cin >> t;
vector<int> v;
for (int i = 1; i <= 1000000; i++)
{
if (check(i))
{
v.push_back(i);
}
}
while (t--)
{
ans = 0;
int x;
cin >> x;
for (int i = 0; i <= x; i++)
{
if (v[i] <= x)
ans++;
else
break;
}
cout << ans << endl;
}
return 0;
}