Pagini recente » Cod sursa (job #2838460) | Cod sursa (job #874333) | Cod sursa (job #693403) | Cod sursa (job #1264073) | Cod sursa (job #442375)
Cod sursa(job #442375)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define N 100005
#define in "prim.in"
#define out "prim.out"
int main()
{
int i,n,k=0,primes[N],*sol;
sol=(int*)calloc(10000000,sizeof(int));
for (n = 2;k < 100000; ++n)
{
if (sol[n] != 0) continue;
for (i = n*n; i<5000000 && n<2000; i+=n)
sol[i]=1;
primes[k]=n;
k++;
}
long long answer;
freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d",&k);
answer=(long long)((long long)primes[k]*(long long)primes[k]);
printf("%lld",answer);
return 0;
}