Pagini recente » Borderou de evaluare (job #2621309) | Cod sursa (job #980802) | Cod sursa (job #533151) | Cod sursa (job #2124841) | Cod sursa (job #2147263)
#include <cstdio>
#define N 2000002
using namespace std;
int n,cnt;
bool prime[N];
void eratosthenes(int n)
{
for(int i=4; i<=n; i=i+2)
{
prime[i]=1;
}
for(int i=3; i*i<=n; i=i+2)
{
if(!prime[i])
{
for(int j=i*i; j<=n; j=j+i)
{
prime[j]=1;
}
}
}
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
eratosthenes(n);
for(int i=2; i<=n; i++)
{
if(!prime[i])
{
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}