Cod sursa(job #2196265)
Utilizator | Data | 18 aprilie 2018 22:02:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
int T,A,B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin >> T;
for (; T; --T)
{
fin >> A >> B;
fout << gcd(A,B) << endl;
}
return 0;
}