Pagini recente » Cod sursa (job #2190860) | Cod sursa (job #1261897) | Cod sursa (job #470514) | Cod sursa (job #800180) | Cod sursa (job #1480621)
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int n,sqrtN,i,j,out;
bool ciur[2000005] = { false };
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
sqrtN = sqrt(n);
j = 2;
while ( (j += 2) <= n) ciur[j] = true;
for (i = 3; i <= sqrtN; i=i+2)
if (!ciur[i])
{
j = i;
while ( (j += 2*i) <= n) ciur[j] = true;
}
for (i = 2; i < n;++i) if(!ciur[i]) out++;
printf("%d", out);
}