Cod sursa(job #35183)
Utilizator | Data | 21 martie 2007 21:33:29 | |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream.h>
int main(){
long long prim[1299743]={0},k,i,j,N=0,cn;
ifstream f("prim.in");
ofstream g("prim.out");
f>>k;
i=2;cn=1;
while(cn<=k+1){
if(!prim[i]){
j=2;
while(j*i<=100000000){
prim[i*j]=1;
j++;
}
if(cn==k+1){
N=i;
break;
}
cn++;
}
i++;
}
g<<N*N;
return 0;
}