Cod sursa(job #2376091)
Utilizator | Data | 8 martie 2019 13:37:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std ;
bitset<2000001> b ;
ifstream in ("ciur.in") ;
ofstream out ("ciur.out") ;
int sol = 1 , n , i , j ;
int main ()
{
in >> n ;
for ( i = 3 ; i <= n ; ++ i )
{
if ( !b[i] && i&1 ) sol ++ ;
for ( j = i*3 ; j <= n ; j +=2*i )
b [ j ] = 1 ;
}
out << sol ;
}