Cod sursa(job #3316487)
| Utilizator | Data | 18 octombrie 2025 22:23:44 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
// !!!
string PREFIX = "euclid2";
int get_gcd(int x, int y) {
if (x == 0) return y;
if (y == 0) return x;
int common = 1;
// acum ambele numere sunt impare.
if (x < y) swap(x, y);
return common * get_gcd(x - y, y);
}
int main()
{
ifstream cin(PREFIX + ".in");
ofstream cout(PREFIX + ".out");
int t;
cin >> t;
while(t--) {
int x, y;
cin >> x >> y;
cout << get_gcd(x, y) << '\n';
}
}