Cod sursa(job #2683399)
Utilizator | Data | 11 decembrie 2020 10:13:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
#include <fstream>
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
std::ifstream in("euclid2.in");
std::ofstream out("euclid2.out");
in >> T;
for (; T; --T)
{
in >> A >> B;
out << gcd(A, B);
}
return 0;
}