Cod sursa(job #1529003)
Utilizator | Data | 20 noiembrie 2015 13:45:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim[2000005];
int N,i,nr;
int main()
{
fin>>N;
for(i=2;i<=N;++i)
if(prim[i]==false)
{
nr++;
for(unsigned int j = i; j <= N; j = j + i)
prim[j] = true;
}
fout<<nr;
return 0;
}