Cod sursa(job #2404501)
Utilizator | Data | 12 aprilie 2019 21:45:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
int T, A, B;
int gcd(int a, int b) {
while (b > 0) {
int c = b;
b = a % b;
a = c;
}
return a;
}
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;
}