Cod sursa(job #2469311)
Utilizator | Data | 6 octombrie 2019 19:19:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
using namespace std;
int cmmdc(int a, int b)
{
unsigned int r;
if(a>b)
{
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
else
{
while(a!=0)
{
r=b%a;
b=a;
a=r;
}
return b;
}
}
int main()
{
int x,y,n,i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x>>y;
cout<<cmmdc(x,y)<<endl;
}
return 0;
}