Cod sursa(job #2478328)
Utilizator | Data | 21 octombrie 2019 21:45:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T, A, B;
int gcd(int A, int B)
{
if (!B) return A;
if (!(A % B)) return B;
else if (A > B) return gcd(B, A % B);
else return gcd(B, A);
}
int main()
{
for (in>>T; T; --T)
{
in>>A>>B;
out<<gcd(A, B)<<'\n';
}
return 0;
}