Cod sursa(job #2640400)
Utilizator | Data | 6 august 2020 13:00:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b) {
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b-a);
}
int main() {
int t;
fin >> t;
while(t--) {
int a, b;
fin >> a >> b;
fout << gcd(a, b) << '\n';
}
return 0;
}