Cod sursa(job #3254493)
Utilizator | Data | 7 noiembrie 2024 17:20:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE* a, *b;
a = fopen("ciur.in", "r");
b = fopen("ciur.out", "w");
int n;
fscanf(a, "%d", &n);
int i, is_prim, cnt=0;
i=2;
int d;
while(i<=n) {
is_prim=1;
d=2;
while(d<i) {
if(i%d==0){
is_prim=0;
d=i;
}
d++;
}
if(is_prim){
cnt=cnt+1;
}
i++;
}
fprintf(b, "%d", cnt);
}