Cod sursa(job #691481)
| Utilizator |  Dinu Radu RaduGabriel2012 |
Data | 26 februarie 2012 12:03:33 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
int main() { int i,j,nr,n;
bool c[2000005];
FILE *f,*g;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
nr=0;
for (i=2;i<=n;i++) if (c[i]==false) for (j=i+i;j<=n;j+=i) c[j]=true;
for (i=2;i<=n;i++) if (!c[i]) nr++;
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}