Cod sursa(job #2184490)
| Utilizator | Data | 24 martie 2018 09:12:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 40 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <stdio.h>
#include <stdlib.h>
char ciur[1000001];
int main()
{
int n, i, d, ct;
FILE *fin, *fout;
fin=fopen("ciur.in", "r");
fout=fopen("ciur.out", "w");
fscanf(fin, "%d", &n );
ct=0;
for(d=2; d<n; d++){
if(ciur[d]==0){
ct++;
for(i=d; i<=n; i+=d)
ciur[i]=1;
}
}
fprintf(fout, "%d", ct);
return 0;
}
