Cod sursa(job #1359222)
Utilizator | tudoras8 tudoras8 | Data | 24 februarie 2015 21:42:49 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
int t, a, b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> t;
while (t--) {
f >> a >> b;
int gcd = 1, q = min(a, b);
for (int i = q; i >= 2; i--)
if (a % i == 0 && b % i == 0) {
gcd = i;
break;
}
cout << gcd << "\n";
}
f.close();
g.close();
return 0;
}