Cod sursa(job #1337214)
| Utilizator | Data | 8 februarie 2015 19:03:19 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000001];
int main()
{
ifstream fin ("prim.in");
ofstream fout ("prim.out");
long long int k;
fin >> k;
long long int cprim=1, curent=2;
while (cprim!=k+1){
if (v[curent]==0){
cprim++;
for (long long int j=curent;j<=1000000;j=j+curent){
v[j]=1;
}
}
curent ++;
}
while (v[curent]!=0){
curent++;
}
fout << curent*curent << endl;
return 0;
}
