Cod sursa(job #2356191)
Utilizator | Data | 26 februarie 2019 15:56:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
using num = unsigned long long;
constexpr num gcd(const int a, const int b)
{
return (b==0)?a:gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
num a,b,n;
cin>>n;
while(n){
cin >>a>>b;
const num r = gcd(a,b);
cout<<r<<endl;
n--;
}
return 0;
}