Cod sursa(job #1699039)
| Utilizator | Data | 5 mai 2016 22:11:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("prim.in");
ofstream out("prim.out");
int k; char a[4000000];
void ciur(int p)
{
int n = 0;
for(long long i = 2; i <= 4000000; i++) {
if(a[i] != 'a') {
n++;
if(n > k) {
out << i * i;
break;
}
for(long long j = 2; j*i <= 4000000; j++) a[i*j] = 'a';
}
}
}
int main()
{
in >> k;
ciur(k);
return 0;
}
