Cod sursa(job #1684385)
Utilizator | Data | 11 aprilie 2016 00:00:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
long gcd(long long a, long long b)
{
if(b == 0)
return a ;
else return gcd(b, a % b) ;
}
int main()
{
ifstream cin("euclid2.in") ;
ofstream cout("euclid2.out") ;
int T;
cin >> T ;
while(T -- ) {
long long a, b ;
cin >> a >> b ;
cout << gcd(a, b) << '\n' ;
}
return 0;
}