Cod sursa(job #1684380)
Utilizator | Data | 10 aprilie 2016 23:56:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <iostream>
using namespace std;
long gcd(long long a, long long b)
{
if(b == 0)
return a ;
return gcd(b, a % b) ;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
short T;
cin >> T ;
while(T -- ) {
long long a, b ;
cin >> a >> b ;
cout << gcd(a, b) << '\n' ;
}
return 0;
}