Cod sursa(job #3133784)
Utilizator | Data | 26 mai 2023 22:45:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *fin, *fout;
int n, i, a, b, r;
fin = fopen("euclid2.in", "r");
fscanf(fin, "%d", &n);
fout = fopen("euclid2.out", "w");
for (i = 0; i < n; i++) {
fscanf(fin, "%d%d", &a, &b);
while (b > 0) {
r = a % b;
a = b;
b = r;
}
fprintf(fout, "%d\n", a);
}
fclose(fin);
fclose(fout);
return 0;
}