Cod sursa(job #257042)
Utilizator | Data | 12 februarie 2009 18:43:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <stdio.h>
int n;
char x[2000001];
int i,c,k;
int ciur(int n)
{
for(i=2;i<=n;i++) x[i]=1;
for(i=2;i<=n;i++)
{
if (x[i]!=0)
{
c=i;
while(c<=n)
{
x[c]=0;
c+=i;
}
k++;
}
}
return k;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%d",ciur(n));
return 0;
}