Cod sursa(job #1691867)
Utilizator | Data | 19 aprilie 2016 17:44:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
int T, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for ( ; T > 0; --T) {
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a, b));
}
return 0;
}