Cod sursa(job #1376638)
| Utilizator | Data | 5 martie 2015 18:08:41 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("prim.in");
ofstream fout("prim.out");
long long n,i,j,cmmdc,k,p[150001],nrp,ok,x;
char c[150001];
void ciur()
{
c[0]=c[1]=0;
for(i=2;i*i<=150000;i++)
if(c[i]==0)
for(j=i*i;j<=150000;j=j+i)
c[j]=1;
for(i=2;i<=150000;i++)
if(c[i]==0) {p[++nrp]=i;}
}
int main()
{
ciur();
fin>>k;
for(i=1;i<=nrp;i++)
if(i==k+1) x=p[i];
fout<<x*x;
return 0;
}
