Pagini recente » Cod sursa (job #2135000) | Cod sursa (job #1686109) | Cod sursa (job #536835) | Cod sursa (job #561511) | Cod sursa (job #1339163)
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
const int MAXN = 2000010;
bitset <MAXN> Ciur;
int main()
{
int N, i, j;
int Ans = 1;
in >> N;
for (i = 3; i * i <= N; i += 2)
if (!Ciur[i])
for (j = i * i; j <= N; j += 2 * i)
Ciur[j] = 1;
for (i = 3; i <= N; i += 2)
if (!Ciur[i])
Ans ++;
out << Ans;
return 0;
}