Cod sursa(job #2309325)
| Utilizator |  Gabi Mihalcea GabyM |
Data | 28 decembrie 2018 20:24:00 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int T, A, B;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
in >> T;
for(; T; --T)
{
for(int i = 0; i < 999999999; i++){}
in >> A >> B;
while(A != B)
{
if(A > B)
A -= B;
else
B -= A;
}
out << A << endl;
}
return 0;
}