Cod sursa(job #338935)
| Utilizator |  mihaig MihaiG |
Data | 7 august 2009 15:44:26 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
int n,i,j,nrprime;
char sir[2000002];
int main () {
fscanf(f,"%d",&n);
for(i=2;i<=n;i++){
if (!sir[i]){
nrprime++;
for (j=i+i;j<=n;j+=i){
sir[j]=1;
}
}
}
fprintf(g,"%d",nrprime);
fclose(f);
fclose(g);
return 0;
}