Pagini recente » Cod sursa (job #373973) | Cod sursa (job #1917288) | Cod sursa (job #1175148) | Cod sursa (job #2942287) | Cod sursa (job #523743)
Cod sursa(job #523743)
/*#include<stdio.h>
int main(void)
{
int i, j, n, count;
char prim[2000005];
freopen("eratostene.in","r",stdin);
freopen("eratostene.out", "w",stdout);
scanf("%d",&n);
for(j=2;j<=n;++j)
prim[j]=1;
for(j=2;j<=n; ++j)
if(prim[j])
{
++count;
for(i=j+j;i<=n;i+=j)
prim[i]=0;
}
printf("%d\n",count);
return 0;
}
*/#include <stdio.h>
int main(void) {
int i, j, n, count;
char prim[2000005];
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(j = 2; j <= n; ++j)
prim[j] = 1;
for(j = 2; j <= n; ++j)
if(prim[j]) {
++count;
for(i = j + j; i <= n; i += j)
prim[i] = 0;
}
printf("%d\n", count);
return 0;
}