Cod sursa(job #442375)

Utilizator skyelHighScore skyel Data 14 aprilie 2010 11:34:48
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#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;      
    }