Cod sursa(job #3312291)
| Utilizator | Data | 27 septembrie 2025 12:56:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ifstream fout("euclid2.out");
int cmmdc(long long a, long long b) {
int r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
long long n, i, a, b;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b;
cout << cmmdc(a,b) << endl;
}
return 0;
}
