Mai intai trebuie sa te autentifici.
Cod sursa(job #2236621)
Utilizator | Data | 30 august 2018 02:38:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long int
#define mod 1000000007
ll gcdx(ll n,ll m)
{
if(!m) return n;
return gcdx(m,n%m);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
ll T;
cin>>T;
while(T--)
{ ll n,m;
cin>>n,m;
cout<<gcdx(n,m);
}
return 0;
}