Pagini recente » Cod sursa (job #2856175) | Cod sursa (job #1054627) | Cod sursa (job #337377) | Cod sursa (job #339988) | Cod sursa (job #2780898)
#include <fstream>
#include <bitset>
using namespace std;
const int NMAX = 2e6;
bitset <NMAX + 1> ciur;
ifstream fin ( "ciur.in" );
ofstream fout ( "ciur.out" );
int main () {
int n, i, j, cate;
fin >> n;
for ( i = 3; i * i <= n; i += 2 )
if ( ciur[i] == 0 )
for ( j = i * i; j <= n; j += i )
ciur[j] = 1;
cate = 1;
for ( i = 3; i <= n; i += 2 )
cate += 1 - ciur[i];
fout << cate << '\n';
return 0;
}