Cod sursa(job #738622)
Utilizator | Data | 21 aprilie 2012 10:31:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
long cmmdc(long a, long b)
{
if(b == 0)
return a;
return cmmdc(b, a%b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
long a, b;
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a >> b;
cout << cmmdc(a, b) << '\n';
}
return 0;
}