Pagini recente » Cod sursa (job #1420020) | Cod sursa (job #1049645) | Cod sursa (job #1772238) | Cod sursa (job #2045861) | Cod sursa (job #1518064)
#include<stdio.h>
#define FIN "ciur.in"
#define FOUT "ciur.out"
#define MAXN 2000002
using namespace std;
bool prim[MAXN];
int main()
{
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
int n;
scanf("%d", &n);
int counter = 0;
for(int i=3; i<=n; i += 2)
{
prim[i+1] = 1;
if(prim[i] == 0)
{
counter++;
for(int j = i * i; j <= n; j += i)
{
prim[i] = 1;
}
}
}
printf("%d", counter);
return 0;
}