Cod sursa(job #1817009)
Utilizator | Data | 27 noiembrie 2016 11:44:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("prim.in");
ofstream fout("prim.out");
int i,n,d,nr,q,a,b;
bool ciur[1299711];
int main()
{
cin>>n;
ciur[1]=1;
ciur[2]=0;
for(i=2;i<=1299709;i++){
if(ciur[i]==0){
nr++;
if(nr-1==n){
q=i;
break;
}
for(d=i+i;d<=1299709;d=d+i)
ciur[d]=1;
}
}
q=1ll*q*q;
cout<<q;
}