Cod sursa(job #2356014)
Utilizator | Greenio Greely greelio | Data | 26 februarie 2019 14:00:14 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
int gcd(int a, int b) {
if (!b) return a;
else return gcd(b, a%b);
}
int main() {
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin>>n;
while (n--) {
cin>>a>>b;
cout<<gcd(a,b)<<'\n';
}
return 0;
}