mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-08 12:58:48 +00:00
P7960 [NOIP2021] 报数【民间数据】
R63196605
This commit is contained in:
parent
9118c3f7c0
commit
d02a257205
47
Luogu/P7960/P7960.cpp
Normal file
47
Luogu/P7960/P7960.cpp
Normal file
@ -0,0 +1,47 @@
|
||||
#include <bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int t, x, ans[200005];
|
||||
bool f[10000005];
|
||||
pair<int, int> q[200005];
|
||||
|
||||
bool has7(int x) {
|
||||
while (x) {
|
||||
if (x % 10 == 7) return true;
|
||||
x /= 10;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
int main() {
|
||||
scanf("%d", &t);
|
||||
for (int i = 7; i <= 10000000; i += 7) {
|
||||
f[i] = true;
|
||||
}
|
||||
for (int i = 1; i <= 10000000; i++) {
|
||||
if (has7(i)) {
|
||||
for (int j = 1; i * j <= 10000000; j++) {
|
||||
f[i * j] = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (int i = 0; i < t; i++) {
|
||||
scanf("%d", &q[i].first);
|
||||
q[i].second = i;
|
||||
}
|
||||
sort(q, q + t);
|
||||
for (int i = 0, j = 1; i < t; i++) {
|
||||
if (f[q[i].first]) {
|
||||
ans[q[i].second] = -1;
|
||||
continue;
|
||||
}
|
||||
while (j <= q[i].first) j++;
|
||||
while (j <= 10000000 && f[j]) j++;
|
||||
ans[q[i].second] = j;
|
||||
}
|
||||
for (int i = 0; i < t; i++) {
|
||||
printf("%d\n", ans[i]);
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user