Cod sursa(job #1308637)
Utilizator | Data | 4 ianuarie 2015 14:57:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
#define Nmax 2000005
bool ciur[Nmax]={false};
int N, nr=1;
int main ()
{
in>>N;
for(int i=3; i<=N; i+=2)
if(ciur[i]==false)
{
nr++;
for(int j=i+i; j<=N; j+=i)
ciur[j]=true;
}
out<<nr<<'\n';
return 0;
}