Cod sursa(job #815167)
Utilizator | Data | 16 noiembrie 2012 17:53:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, a, b;
int main() {
fin >> n;
for (; n > 0; n--) {
fin >> a >> b;
while (a % b) {
if (a > b)
a %= b;
else
b %= a;
}
if (a > b)
fout << b << '\n';
else
fout << a << '\n';
}
fin.close();
fout.close();
return 0;
}