Cod sursa(job #2298867)
Utilizator | Data | 8 decembrie 2018 16:21:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int N,i,j,prim[2000005],c=1;
in>>N;
for (i = 3; i <= N; i=i+2)
if (prim[i]==0)
{
c++;
for (j = i+i+i; j <= N; j=j+i)
prim[j] = 1;
}
out<<c;
return 0;
}