Cod sursa(job #154404)
Utilizator | Data | 11 martie 2008 10:17:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#define N 2000010
int n,i,j;
int sol[1024];
char viz[N];
void solv(){
int cont=0;
for(i=2;i<=n;i++)
if(viz[i]==0){
for(j=i+i;j<=n;j+=i)
viz[j]=1;
cont++;
}
printf("%d\n",cont);
}
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
solv();
return 0;
}