Cod sursa(job #2498092)
Utilizator | Data | 23 noiembrie 2019 14:40:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T;
int a, b;
int CMMDC(int A, int B)
{
if(a>=2)
{
if(!B)
return A;
return CMMDC(B, A%B);
}
}
int main()
{
fin>> T;
for(int i=0; i<T; i++)
{
fin >>a>>b;
fout<<CMMDC(a, b)<<endl;
}
fin.close();
fout.close();
return 0;
}