Cod sursa(job #2138951)
| Utilizator | Data | 21 februarie 2018 23:18:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int euclid(int a, int b)
{
while (a > 0 && b > 0)
if (a > b) a -= b;
else b -= a;
if (a != 0)
return a;
else
return b;
}
int main()
{
int t, a, b;
fi>>t;
for (int i = 0; i < t; i++) {
fi>>a>>b;
fo<<euclid(a, b)<<endl;
}
fo.close();
return 0;
}
