Cod sursa(job #3164988)
Utilizator | Onut Andrei andreiomd1 | Data | 4 noiembrie 2023 22:08:20 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
static inline int gcd(const int &a, const int &b)
{
if (!a)
return b;
if (!b)
return a;
if (a > b)
return gcd((a % b), b);
return gcd(a, (b % a));
}
static inline void test_case()
{
int a = 0, b = 0;
f >> a >> b;
g << gcd(a, b) << '\n';
return;
}
int main()
{
f.tie(nullptr);
int t = 0;
f >> t;
for (int q = 1; q <= t; ++q)
test_case();
return 0;
}