Cod sursa(job #2639267)
Utilizator | Data | 1 august 2020 11:13:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int gcd(int a, int b)
{
if (b)
return gcd(b, a % b);
else
return a;
}
int main()
{
int a, b, t;
cin >> t;
while (t--)
{
cin >> a >> b;
cout << gcd(a, b) << '\n';
}
return 0;
}