Cod sursa(job #2768561)
Utilizator | Data | 11 august 2021 12:49:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int CMMDC(int a, int b) {
if(b == 0 ) {
return a;
}
else {
return CMMDC(b, a%b);
}
}
int main() {
int n, a, b;
cin >> n;
for(int i = 1;i<=n;i++) {
cin >> a >> b;
cout << CMMDC(a, b) << endl;
}
}