Cod sursa(job #154070)
Utilizator | Data | 10 martie 2008 21:46:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
char notprime[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, i, j, sol=0, start=1, k=0;
scanf("%d", &n);
notprime[1]=1;
for (i=1; i<=n; i++)
{
if (!notprime[i])
{
++sol;
for (j=i+i; j<=n; j+=i)
notprime[j]=1;
}
}
printf("%d\n", sol);
fclose(stdout);
return 0;
}