Cod sursa(job #1554859)
Utilizator | Data | 21 decembrie 2015 20:48:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
void swap(int &a, int &b) {
int x = a;
a = b;
b = x;
}
int cmmdc(int a, int b) {
while (b != 0)
{
a = a%b;
swap(a, b);
}
return a;
}
int main() {
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int t, i, a, b;
in >> t;
for (i = 1; i <= t; i++)
{
in >> a >> b;
out << cmmdc(a, b) << '\n';
}
}