Cod sursa(job #2151113)
Utilizator | Data | 4 martie 2018 09:10:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define nmax 200000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,pus[nmax],nr;
int main()
{
fin>>N;
for(int i =2 ; i <= N; i ++)
{
if(pus[i]==0)
{
nr++;
for(int j= i+i; j <= N; j+=i)
pus[j]=-1;
}
}
fout<<nr<<'\n';
return 0;
}