Cod sursa(job #2912665)
Utilizator | Data | 9 iulie 2022 18:58:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int cmmdc(int x, int y) {
if (y == 0)
return x;
else return cmmdc(y, x % y);
}
void citire() {
int x, y;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> x >> y;
fout << cmmdc(x, y) << "\n";
}
}
int main() {
citire();
return 0;
}