Cod sursa(job #979643)
Utilizator | Data | 2 august 2013 11:32:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset <2000005> b;
int i,k,i1,n;
int main(void)
{
FILE * f;
f=fopen("ciur.in","r");
ofstream g("ciur.out");
fscanf(f,"%d",&n);
k=0;
for (i=2;i<=n;i++)
if (b[i]==0)
{
k++;
for (i1=i*i;i1<=n;i1=i1+i)
b[i1]=1;
}
g<<k<<'\n';
g.close();
return 0;
}