Cod sursa(job #1684371)
| Utilizator | Data | 10 aprilie 2016 23:47:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <bitset>
#include <stdio.h>
using namespace std ;
const int NMAX = 2000005 ;
bitset <NMAX> use ;
int N, cnt ;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
cin >> N ;
for(int i = 2 ; i <= N ; ++ i)
if(use[i] == 0)
{
cnt ++ ;
for(int j = i + i ; j <= N ; j = j + i)
use[j] = 1 ;
}
cout << cnt << '\n' ;
return 0 ;
}
