Cod sursa(job #2096412)
Utilizator | Data | 29 decembrie 2017 08:38:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T, A, B;
int gcd(int a, int b)
{
if (!b)
return a;
return gcd(b, a%b);
}
int main(void)
{
fin>>T;
for (; T; --T)
{
fin>>A>>B;
fout<<gcd(A,B)<<endl;
}
return 0;
}