Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<stdio.h>#include<string.h>#include<math.h>#include<queue>#include<vector>using namespace std;int prime[1000006];int Isprime[1000006];int shai(int n){memset(Isprime,0,sizeof(Isprime));int cnt=0;Isprime[1]=1;for(int i=2;i<n;i++)if(Isprime[i]==0){prime[++cnt]=i;for(int j=i*2;j<=n;j+=i){Isprime[j]=1;}}return cnt;}int main(){int cnt=shai(1000000);int n;scanf("%d",&n);for(int i=1;i<=cnt;i++)