Cod sursa(job #1408214)
Utilizator | Data | 29 martie 2015 22:08:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <bitset>
using namespace std;
int n, i, j, sol;
bitset <2000001> c;
int main ()
{
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
scanf ("%d", &n);
for (i=2; i<=n; i++) c[i]=1;
for (i=2; i<=n; i++)
{
if (c[i])
{
sol++;
for (j=i+i; j<=n; j+=i) c[j]=0;
}
}
printf ("%d", sol);
}