Cod sursa(job #1303984)
Utilizator | Data | 28 decembrie 2014 16:01:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX=2000001;
bool prim[NMAX];
int N,i,nr;
void marcare()
{
for(int j=i;j<=N;)
{
j=j+i;
prim[j]=true;
}
}
int main()
{
fin>>N;
for(i=2;i<=N;++i)
if(prim[i]==false)
marcare(),++nr;
fout<<nr;
return 0;
}