Pagini recente » Cod sursa (job #2453799) | Cod sursa (job #1318286) | Cod sursa (job #3210770) | Cod sursa (job #3255595) | Cod sursa (job #1321480)
#include <iostream>
#include <fstream>
using namespace std;
long long n,i,d,nr;
char ciur[2000000];
ofstream g("ciur.out");
int main()
{freopen("ciur.in","r",stdin);
scanf("%lld",&n);
ciur[1]=1;
for ( d = 2; d * d <= n; d++ )
if ( ciur[d] == 0 )
for ( i = d * d; i <= n; i = i + d )
ciur[i] = 1;
nr=0;
for(i=2;i<=n;i++)
if(ciur[i]==0)
nr++;
g<<nr;
return 0;
}