Cod sursa(job #1777572)
Utilizator | Data | 12 octombrie 2016 17:34:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int gcd(long long a,long long b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main()
{
long long n;
long long a;
long long b;
cin >> n;
while (n)
{
cin >> a >> b;
cout << gcd(a,b) << endl;
n--;
}
return 0;
}