| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 69943 | jaypei | 埃氏筛法求区间质数 | C++ | Wrong Answer | 0 MS | 248 KB | 429 | 2025-10-14 19:38:16 |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int flag[10005]; for(int i=0;i<n;i++){ flag[i]=1; } for (int i=1; i*i<=n;i++) { if (flag[i]) { for (int j = i * i; j <= n; j += i) flag[j] = 0; } } for (int i=1;i<=n;i++) if (flag[i]==1) cout << i <<" "; return 0; }