Cod sursa(job #1037578)
Utilizator | Data | 20 noiembrie 2013 13:37:19 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | cei_mici_2 | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
#define MAX 2000000
bool a[MAX+20];
int main()
{
ifstream fin("prim.in");
ofstream fout("prim.out");
long long int i,k,j;
fin>>k;
k++;
for(i=2;k;i++)
if(!a[i])
{
for(j=i*i;j<=MAX;j+=i)
a[j]=1;
k--;
}
i--;
fout<<i*i;
fin.close();
fout.close();
return 0;
}