Cod sursa(job #2657767)
Utilizator | Sabbir Jaman panda001 | Data | 11 octombrie 2020 22:08:21 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
long long gcd(long long a , long long b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int test;
scanf("%d",&test);
for(int tc=1; tc <=test; tc++)
{
long long a,b;
scanf("%lld%lld",&a,&b);
printf("%lld\n",gcd(max(a,b),min(a,b)));
}
return 0;
}