Cod sursa(job #2360639)
| Utilizator | Data | 1 martie 2019 23:54:46 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
int gcb(int a, int b) {
int t;
while (b != 0) {
t = b;
b = a % b;
a = t;
}
return a;
}
int main() {
int i, n, a, b, d;
FILE* fin = fopen("euclid2.in", "r");
FILE* fout = fopen("euclid2.out", "w");
fscanf(fin, "%d", &n);
for (i = 0; i < n; i++) {
fscanf(fin, "%d %d", &a, &b);
d = gcb(a, b);
fprintf(fout, "%d\n", d);
}
fclose(fin);
fclose(fout);
return 0;
}
