Cod sursa(job #2052614)
Utilizator | Data | 30 octombrie 2017 20:26:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int cmmdc(int a,int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
int n,a,b;
cin>>n;
for(;n;n--)
{cin>>a>>b;
cout<<cmmdc(a,b);
}
return 0;
}