Cod sursa(job #1358385)
Utilizator | Data | 24 februarie 2015 16:23:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
#include<bitset>
using namespace std;
bitset<2000010> v;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, count = 0;
scanf("%d", &n);
for(int i = 2 ; i < n ; ++i)
if(!v[i]) {
++count;
for(int j = i ; j < n ; j += i)
v[j] = 1;
}
printf("%d", count);
return 0;
}