Pagini recente » Cod sursa (job #2761356) | Cod sursa (job #2293531) | doartest | Cod sursa (job #2219795) | Cod sursa (job #1761398)
#include <cstdio>
using namespace std;
char p[2000000];
int ciur(int n)
{
int nr = 0;
for(int i = 0; i < 2000000; ++i)
p[i] = 1;
for (int i = 1; ((i * i) << 1) + (i << 1) <= n; ++i)
if (p[i])
for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1)
p[j] = 1;
for(int i = 1; (i << 1) + 1 <= n; ++i)
if(p[i])
nr++;
return nr;
}
int main()
{
int n;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
printf("%d\n", ciur(n));
}