#1118. 【NOIP2021】报数

https://sjzezoj.com/submission/64199

S2OJ/1118/1118.cpp

@@ -1,11 +1,68 @@
-#include <bits/stdc++.h>
+#include <iostream>
+#include <algorithm>
+#include <utility>
 
-using namespace std;
+using std::cin;
+using std::cout;
+const char endl = '\n';
 
-int n, l, r;
+const int T = 2e5 + 5,
+          N = 1e7 + 5;
+
+int t, x, ans[T];
+bool f[N];
+std::pair<int, int> q[T];
+
+bool has7(int x) {
+    while (x) {
+        if (x % 10 == 7) return true;
+        x /= 10;
+    }
+
+    return false;
+}
 
 int main() {
-    cin >> n >> l >> r;
-    cout << min((int)(ceil(1.0 * l / n) * n + n - 1), r) % n << endl;
+    std::ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    cin >> 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++) {
+        cin >> q[i].first;
+
+        q[i].second = i;
+    }
+
+    std::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++) {
+        cout << ans[i] << endl;
+    }
+
     return 0;
 }