Cod sursa(job #297814)
Utilizator | Data | 5 aprilie 2009 17:21:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
int n,c,s[4000000];
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j;
scanf("%d",&n);
for(i=2;i<=n;i++)
s[i]=1;
for(i=2;i<=n;i++)
if(s[i]!=0){
c++;
for(j=i+i;j<=n;j=j+i)
s[j]=0;
}
printf("%d",c);
return 0;}