Pagini recente » Cod sursa (job #45321) | Cod sursa (job #1383772) | Cod sursa (job #233376) | Cod sursa (job #1575478) | Cod sursa (job #1894066)
#include <cstdio>
#include <cmath>
using namespace std;
int const NMAX=13000000;
char c[NMAX + 5];
int ciur(int n) {
int lim = (int)sqrt((double) n);
for(int i = 3; i <= lim; i = i + 2)
if(c[i] == 0)
for(int j = i * i; j <= NMAX; j = j + 2 * i)
c[j] = 1;
int rasp = 0;
for(int i = 2; i <= NMAX; ++ i) {
if(c[i] == 0 && i <= n)
++ rasp;
}
printf("%d\n", rasp);
}
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
ciur(n);
return 0;
}