Cod sursa(job #1076883)
Utilizator | Data | 10 ianuarie 2014 18:00:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
int N,ct;
char prim[2000005];
int main(void)
{
int i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
for(i=2;i<=N;i++){
prim[i]=1;
}
for(i=2;i<=N;i++){
if(prim[i]){
ct++;
for(j=i+i;j<=N;j+=i){
prim[j]=0;
}
}
}
printf("%d\n",ct);
return 0;
}