Cod sursa(job #1339999)
Utilizator | Data | 11 februarie 2015 13:51:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.44 kb |
#include <fstream>
#include <bitset>
using namespace std ;
ifstream cin("ciur.in") ;
ofstream cout("ciur.out") ;
bitset <2000005> ciur ;
int N, cnt ;
int main()
{
int i, j ;
cin >> N ;
for(i = 2 ; i <= N ; ++ i)
if(ciur[i] == 0) {
++ cnt ;
for(j = i + i ; j <= N ; j = j + i)
ciur[j] = 1 ; }
cout << cnt ;
cin.close() ;
cout.close() ;
return 0;
}