Cod sursa(job #1324537)
Utilizator | Data | 22 ianuarie 2015 15:26:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int n, cnt;
char c[2000005];
int main()
{
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(i=2; i<=n; i++)
c[i]=1;
for(i=2; i<=n; i++)
{
if(c[i]!=0)
{
cnt++;
for(j=i+i; j<=n; j=j+i)
{
c[j]=0;
}
}
}
printf("%d\n", cnt);
return 0;
}