Cod sursa(job #3312283)
| Utilizator | Data | 27 septembrie 2025 12:44:16 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int cmmdc(int a, int b) {
while (b) {
int r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
int t, a, b, v[100001], r = 0;
in >> t;
for (int i = 0; i < t; i++) {
in >> a >> b;
v[++r] = cmmdc(a, b);
}
for (int i = 1; i <= r; i++) {
out << v[i] << endl;
}
return 0;
}
