Cod sursa(job #2184164)
Utilizator | Data | 23 martie 2018 19:36:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<bits/stdc++.h>
using namespace std;
int t,a,b;
int gcd(int a, int b) {
if (b==0) return a;
return gcd(b, a%b);
}
int main() {
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin>>t;
while (t--) {
cin>>a>>b; if (a<b) swap(a,b);
cout<<gcd(a,b)<<'\n';
}
return 0;
}