Pagini recente » Cod sursa (job #2754495) | Cod sursa (job #2492746) | Cod sursa (job #763458) | Cod sursa (job #572566) | Cod sursa (job #2531362)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define nMax 1000005
int main() {
int n, prime = 1;
char v[nMax];
f >> n;
for (int i = 1; ((i * i) << 1) + (i << 1) <= n; i++) {
if (v[i]) {
for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1)
v[j] = 0;
}
}
for (int i = 1; 2 * i + 1 <= n; i++)
if (v[i]) prime++;
g << prime;
}