Cod sursa(job #2574427)
| Utilizator | Data | 5 martie 2020 22:12:04 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int N, a, b;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
//ios_base::sync_with_stdio(false);
cin >> N;
while (N--)
{
cin >> a >> b;
cout << gcd(a, b) << "\n";
}
return 0;
}
