Cod sursa(job #383087)
Utilizator | Data | 15 ianuarie 2010 17:08:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<stdio.h>
int n,i,j,nr;
char a[2000000];
int main ()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
if(a[i]==0)
{nr++;
for(j=2;j<=n/i;j++)
a[i*j]=1;
}
printf("%d",nr);
return 0;
}