Cod sursa(job #3330775)
| Utilizator | Data | 22 decembrie 2025 00:35:36 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n;
in >> n;
while(n) {
--n;
int a, b, c;
in >> a >> b;
if (a > b) {
int aux = a;
a = b;
b = aux;
}
while (b) {
c = b % a;
a = b;
b = c;
}
out << a << '\n';
}
in.close();
out.close();
return 0;
}