Cod sursa(job #2683395)
Utilizator | Data | 11 decembrie 2020 09:59:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
long long unsigned a, b, t;
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
in >> t;
while (t--)
{
in >> a >> b;
out << gcd(a, b) << std::endl;
}
in.close();
out.close();
return 0;
}