Cod sursa(job #2230358)
Utilizator | Data | 9 august 2018 20:16:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
int main()
{
int n, x, y, r, i;
FILE *in, *out;
in = fopen("euclid2.in", "r");
out = fopen("euclid2.out", "w");
fscanf(in, "%d", &n);
for (i = 0; i < n; i++) {
fscanf(in, "%d %d", &x, &y);
do {
r = x % y;
x = y;
y = r;
} while (y != 0);
fprintf(out, "%d\n", x);
}
fclose(in);
fclose(out);
return 0;
}