Cod sursa(job #2254088)
| Utilizator | Data | 4 octombrie 2018 19:28:30 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool x[2000005];
long long n, k;
int main()
{
bool x[2000005];
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<< k;
}
