Pagini recente » Borderou de evaluare (job #1326886) | Borderou de evaluare (job #1544767) | Borderou de evaluare (job #1975468) | Cod sursa (job #1264080) | Cod sursa (job #409908)
Cod sursa(job #409908)
#include<stdio.h>
int main()
{
long n,contor=0;
char prim[2000001];
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for(long i=2; i<=n; ++i)
prim[i]=1;
for(long i=2; i<=n;++i)
if(prim[i])
{
++contor;
for(int j=i*2;j<=n;j+=i)
prim[j]=0;
}
printf("%ld",contor);
return 0;
}