Pagini recente » Cod sursa (job #552483) | Cod sursa (job #1190289) | Cod sursa (job #2123180) | Cod sursa (job #233586) | Cod sursa (job #1850412)
#include <cstdio>
using namespace std;
bool v[2000001];
int ciur(int n)
{
int nr=1;
for (int i=4;i<=n;i+=2)
v[i]=1;
for (int i=3;i<=n;i+=2)
if (v[i]==0)
{
nr++;
if ((long long)i*i<=2000000)
for (int j=i*i;j<=n;j+=i)
v[j]=1;
}
return nr;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
scanf("%d ",&n);
printf("%d ",ciur(n));
}