Cod sursa(job #2767511)
| Utilizator | Data | 6 august 2021 15:24:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | c-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
char prim[20000005]; //se declara global, merge si cu char
int main()
{int n, cnt=0, i, j;
FILE *fin, *fout;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin, "%d", &n);
prim[0]=prim[1]=0;
for (i=2; i<=n; ++i)
prim[i]=1; //pp ca toate sunt prime, folosind un vector de frecventa
for (i=2; i<=n; ++i)
if (prim[i]) {
cnt++;
for(j=i+i; j<=n; j+=i) prim[j]=0;
}
fprintf ( fout, "%d", cnt);
fclose(fin); fclose (fout);
return 0;
}
