Cod sursa(job #3312574)
| Utilizator | Data | 29 septembrie 2025 09:39:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(long long a, long long b) {
while (b) {
int x = a % b;
a = b;
b = x;
}
return a;
}
int main() {
long long n;
in >> n;
for (int i = 1; i <= n; ++i) {
long long a, b;
in >> a >> b;
out << cmmdc(a, b) << endl;
}
return 0;}
