Cod sursa(job #2419266)
Utilizator | Data | 7 mai 2019 21:56:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
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 (int i = 1; i <= T; i++)
{
fin>>A>>B;
fout<<gcd(A, B)<<endl;
}
return 0;
}