Cod sursa(job #2402839)
Utilizator | Data | 11 aprilie 2019 08:27:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int main()
{
int n,a,b;
cin>>n;
for(int i=1; i<=n; ++i)
{
cin>>a>>b;
int r=1;
if(a<b) swap(a,b);
while(r)
{
r=a%b;
a=b;
b=r;
}
cout<<a<<endl;
}
return 0;
}