Cod sursa(job #2486755)
Utilizator | Data | 3 noiembrie 2019 14:10:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdtr1c++.h>
using namespace std;
int cmmdc(long long int a,long long int b)
{
long long int r;
if(a==0 or b==0)
return a+b;
while(a%b!=0)
{
r=a%b;
a=b;
b=r;
}
return b;
}
int main()
{
int n,a,b;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
cout<<cmmdc(a,b)<<'\n';
}
return 0;
}