Cod sursa(job #2287350)
Utilizator | Data | 21 noiembrie 2018 19:50:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int T;
inline int gcd(int a,int b)
{
if(b==0)
{
return a;
}
else
{
return gcd(b,a%b);
}
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
cin>>T;
while(T--)
{
int kol1,kol2;
cin>>kol1>>kol2;
cout<<gcd(kol1,kol2)<<"\n";
}
return 0;
}