Cod sursa(job #2252022)
Utilizator | Data | 2 octombrie 2018 11:36:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | musai_must | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
using namespace std;
int T, a, b;
int euclid(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
cin>>T;
for(int i=1;i<=T;i++)
{
cin>>a>>b;
cout<<euclid(a,b)<<'\n';
}
return 0;
}