Cod sursa(job #2645786)
Utilizator | Data | 29 august 2020 16:21:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream be("euclid2.in");
ofstream ki("euclid2.out");
long lnko(long a,long b)
{
int r = a % b;
while (r!=0)
{
a = b;
b = r;
r = a % b;
}
return b;
}
/*long lnkoRek(long a,long b)
{
if(a==0)return b;
else if(b==0)return a;
else if(a>b)return lnkoRek(a%b,b);
else return lnkoRek(a,b%a);
}
*/
int main()
{
long n,a,b;
be>>n;
for(int i=1;i<=n;++i)
{
be>>a>>b;
ki<<lnko(a,b)<<endl;
}
return 0;
}