Cod sursa(job #3312249)
| Utilizator | Data | 27 septembrie 2025 11:00:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int cmmdc (int a, int b) {
int r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int n, i, a, b, r, T;
int main() {
fin >> T;
for (i = 1; i <= T; i++) {
fin >> a >> b;
fout << cmmdc(x, y) << endl;
}
return 0;
}
