Cod sursa(job #2487241)
Utilizator | Data | 4 noiembrie 2019 12:21:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,i,j,nr,cnt;
char prim[2000005];
bool ok=1;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main()
{ fin>>N;
for (i = 2; i <= N; ++i)
prim[i] = 1;
for (i = 2; i <= N; ++i)
if (prim[i]!=0)
{
++cnt;
for (j = i+i; j <= N; j=j+i)
prim[j] = 0;
}
fout<<cnt;
}