Cod sursa(job #2679856)
Utilizator | Data | 1 decembrie 2020 18:24:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
int cmmdc(int a, int b) {
if (b > a)
swap(b, a);
return a % b;
}
int main() {
int a, b;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
cout << cmmdc(a, b) << "\n";
}
}