Cod sursa(job #3237249)
Utilizator | Data | 7 iulie 2024 14:37:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a, b, n;
int cmmdc(int n, int m) {
while (m != 0) {
int r = n % m;
n = m;
m = r;
}
return n;
}
int main() {
f >> n;
for (int i = 0; i < n; i++) {
f >> a >> b;
g << cmmdc(a, b) << "\n"'
}
}