Cod sursa(job #2309180)
Utilizator | Data | 28 decembrie 2018 15:54:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int T, A, B;
int gcd(int A, int B)
{
if (!B) return A;
if (A > B) return gcd(A-B, B);
return gcd(A, B-A);
}
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
in >> T;
for(int i = 0; i < T; i++)
{
in >> A >> B;
out << gcd(A, B) << endl;
}
in.close();
out.close();
return 0;
}