Cod sursa(job #1588219)
Utilizator | Data | 2 februarie 2016 21:41:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include<bitset>
using namespace std;
bitset <2000002> b;
int i,j,n,k;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if(!b.test(i))
for(j=2*i;j<=n;j+=i) b.set(j,1);
for(i=2;i<=n;i++) if(!b.test(i)) k++;
g<<k;
f.close();
g.close();
return 0;
}