| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 57106 | 陶俊宸 | 密码质数 | C++ | Accepted | 100 | 0 MS | 272 KB | 327 | 2022-08-03 18:59:23 |
#include<iostream> bool st[5001]; int n,pn[669],cnt,num; int main(){ for(int i=2;i<=5000;i++){ if(!st[i]) pn[cnt++]=i; for(int j=0;i*pn[j]<=5000;j++){ st[i*pn[j]]=1; if(!(i%pn[j])) break; } } scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&num); printf("%d\n",pn[num-1]); } return 0; }