Cod sursa(job #501386)
| Utilizator | Data | 14 noiembrie 2010 21:11:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
//#include <algorithm>
#include <bitset>
#include <fstream>
using namespace std;
#define dim 2000001
bitset <dim> v;
int main()
{
long n, f=1;
//freopen ("ciur.in","r",stdin) ;
//freopen ("ciur.out","w",stdout) ;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
//scanf("%d", &n);
fin>>n;
for(int i=2;i<n;++i)
{
++i;
if(!v[i])
{
++f;
for(int j=i;j<=n/i;++j)
{
v[j*i]=1;
++j;
}
}
}
//printf("%d", f);
fout<<f;
return 0;
}