Cod sursa(job #502104)
| Utilizator | Data | 17 noiembrie 2010 19:13:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <algorithm>
#include <bitset>
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);
scanf("%d" , &n);
for(int i=2;i<n;++i)
{
++i;
if(!v[i])
{
++f;
for(int j=i;j<=n/i;++j)
{
v[i*j]=1;
++j;
}
}
}
printf("%ld", f);
return 0;
}