Cod sursa(job #1898068)
| Utilizator | Data | 1 martie 2017 20:20:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <bitset>
#include <fstream>
using namespace std;
int main()
{
int i,j,k,c=0,N;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000000>ciur;
for(i=1;i<2000000;i++)
ciur[i]=1;
for(i=2;i<2000000;i++)
{
if(ciur[i]==1)
for(j=i+i;j<=2000000;j=j+i)
ciur[j]=0;
}
fin>>N;
for(i=2;i<=N;++i)
{
if(ciur[i]==1)
c++;
}
fout<<c;
return 0;
}
