Cod sursa(job #2254598)
| Utilizator | Data | 5 octombrie 2018 16:51:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool x[2000005];
long long n, k;
int main()
{
long long k, n;
in >> k;
for (long long i=2; i<=n;i++){
if (!x[i]){
n++;
for (long long j = i*i; j<=n; j+=i){
x[j]=true;
}
}
}
out<< n;
}
