Cod sursa(job #1548585)
Utilizator | Data | 11 decembrie 2015 08:45:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include<bitset>
#include<fstream>
using namespace std;
bitset<20000001> ciur;
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int d,n,i,s=0;
fin>>n;
for ( d = 2; d * d <= n; d++ )
if ( ciur[d] == 0 )
for ( i = d * d; i <= n; i = i + d ) ciur[i] = 1;
for(i=2;i<=n;i++)if(ciur[i]==0)s++;
fout<<s;
return 0;
}