Cod sursa(job #2266238)
Utilizator | Data | 22 octombrie 2018 15:19:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <bitset>
using namespace std;
int main()
{
ifstream fin("kdiv.in");
ofstream fout("kdiv.out");
bitset <2000000> ciur;
ciur.set();
ciur[1]=0;
int n,cnt=0;
fin>>n;
for(int i=2;i<=n;i++)
if(ciur[i]==1) for(int j=i+i;j<=n;j=j+i)
ciur[j]=0;
for(int i=2;i<=n;i++)
if(ciur[i]==1) cnt++;
fout<<cnt;
return 0;
}