Cod sursa(job #2909900)
Utilizator | Data | 16 iunie 2022 18:30:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
long long int cmmdc(long long int a, long long int b)
{
if(b == 0)
return a;
else if(a == 0)
return b;
else
return cmmdc(b, a%b);
}
long long int t, a, b;
int main()
{
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin>>t;
for(int i=1; i<=t; i++)
{
cin>>a>>b;
cout<<cmmdc(a, b)<<endl;
}
return 0;
}