Cod sursa(job #273766)
| Utilizator | Data | 8 martie 2009 23:35:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
#include <math.h>
long i, j, n, k=0;
int main()
{
FILE *f=fopen("ciur.in", "r");
fscanf(f, "%ld", &n);
fclose(f);
f=fopen("ciur.out", "w");
if(n>=2) fprintf(f,"2,\n");//k=1;
for(i=3;i<=n;i+=2)
{
j=3;
while((j<=sqrt(i))&&(i%j!=0)) j+=2;
if(i%j!=0) { fprintf(f, "%ld,\n", i); k++; }
}
fprintf(f, "\nnumere: %ld", k+1);
fclose(f);
return 0;
}