Cod sursa(job #2165115)
Utilizator | Data | 13 martie 2018 11:12:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
int r = a % b;
while(r){
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
freopen("gcd.in","r",stdin);
freopen("gcd.out","w",stdout);
int N;
cin >> N;
while(N--) {
int a, b;
cin >> a >> b;
cout << gcd(a, b) << '\n';
}
return 0;
}