Cod sursa(job #732762)
Utilizator | Data | 10 aprilie 2012 21:56:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
main(){
FILE *f,*g;
int a[100000];
int ok,n,k,i,nr,j;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
k=0;
ok=0;
i=1;
nr=0;
while (i<n-1) {
i++;
ok=0;
for(j=1;j<=k;j++)
if (i %a[j]==0){
ok=1;
break;
}
if (ok==0){
k++;
a[k]=i;
nr++;
}
}
fprintf(g,"%d",nr);
fclose(g);
return 0;
}