Cod sursa(job #1635830)
Utilizator | Data | 6 martie 2016 20:19:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define nMax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool ciur[nMax];
int sieve()
{
int nr=1;
for(int i=3;i<=n;i+=2)
{
if(ciur[i]==0)
{
nr++;
for(int j=i+i+i;j<=n;j+=i << 1)
ciur[j]=1;
}
}
return nr;
}
int main()
{
fin>>n;
fout<<sieve();
return 0;
}