Cod sursa(job #2457899)
Utilizator | Data | 18 septembrie 2019 22:56:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
int t,a,b;
int gcd(int A, int B) {
if (!B) return A;
return gcd(B, A % B);
}
int main (void) {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &t);
for (;t;t--) {
scanf("%d %d", &a, &b);
printf("d%\n", gcd(a,b));
}
return 0;
}