Pagini recente » Cod sursa (job #1143731) | Cod sursa (job #1128079) | Cod sursa (job #1685841) | Cod sursa (job #1519130) | Cod sursa (job #975069)
Cod sursa(job #975069)
#include<stdio.h>
#include<string.h>
#define maxn 2000005
using namespace std;
int n,sol;
bool sieve[maxn];
void solve()
{
scanf("%d",&n);
int i,j;
memset(sieve,true,sizeof(sieve));
for(i=3;i*i<=n;i+=2)
if(sieve[i])
for(j=i;i*j<=n;j++)
sieve[i*j]=false;
for(i=3;i<=n;i+=2)
if(sieve[i]) sol++;
printf("%d",sol+1);
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
solve();
fclose(stdin);
fclose(stdout);
return 0;
}