0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 20:48:47 +00:00
OI-codes/Luogu/problem/P1590/P1590.cpp

32 lines
504 B
C++
Raw Normal View History

2020-09-26 11:39:31 +00:00
// 70' Code (R38866815)
#include <bits/stdc++.h>
using namespace std;
bool find(int s, int x) {
while (s) {
if (s % 10 == x) {
return true;
}
s /= 10;
}
return false;
}
int main() {
int t, n, ans;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
ans = 0;
for (int i = 1; i <= n; i++) {
if (!find(i, 7)) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}