Pagini recente » Cod sursa (job #1241667) | Cod sursa (job #1049479) | Cod sursa (job #75402) | Cod sursa (job #603879) | Cod sursa (job #1518059)
#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=2; i<=n; i++)
{
if(prim[i] == 0)
counter++;
for(int j=i*i; j<=n; j+=i)
prim[j] = 1;
}
printf("%d", counter);
return 0;
}