Cod sursa(job #2774539)
Utilizator | Data | 11 septembrie 2021 20:31:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int GCD(int a, int b) {
if (!b) return a;
return GCD(b, a % b);
}
int main() {
int n, x, y;
cin >> n;
while (n != 0) {
cin >> x >> y;
cout << GCD(x, y) << endl;
n--;
}
return 0;
}