Cod sursa(job #1292695)
Utilizator | Data | 14 decembrie 2014 17:29:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
inline int gcd (int A, int B)
{
int r = A % B;
while (r){
A = B;
B = r;
r = A % B;
}
return B;
}
int main()
{
int T, A, B;
for (in >> T; T; T --){
in >> A >> B;
out << gcd (A, B) << "\n";
}
return 0;
}