Cod sursa(job #2361321)
Utilizator | Data | 2 martie 2019 14:32:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int n;
inline int CMMDC(int x , int y)
{
if(!y)
return x;
return CMMDC(y , x % y);
}
int main()
{
int x , y;
fin >> n;
for(int i = 1 ; i <= n ; i++)
{
fin >> x >> y;
fout << CMMDC(x , y) << "\n";
}
fin.close();
fout.close();
return 0;
}