Cod sursa(job #547399)
Utilizator | Data | 6 martie 2011 12:17:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<cstdio>
char a[2000001];
int n,i,j,k;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
if(a[i]){
k++;
for(j=2*i;j<=n;j+=i)
a[j]=0;
}
printf("%d",k);
return 0;
}