Cod sursa(job #1208338)

Utilizator cristibogdanPatrascu Cristian cristibogdan Data 15 iulie 2014 14:13:40
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("prim.in");
ofstream g("prim.out");
int i,n,t,j,k;
long long p;

char v[2000001];
int main()
{f>>k;
k=k+1;
for(i=2;i<=2000000;i++)
    v[i]=0;
    for(i=2;i<=2000000;i++){
        if(v[i]==0){

            for(j=2*i;j<=2000000;j+=i)
                v[j]=1;}

        }
for(i=2;i<=2000000;i++)
    if(v[i]==0){
        t++;
            if(t==k)
                break;}
        p=i*i;
g<<p;

    return 0;
}