Mai intai trebuie sa te autentifici.
Cod sursa(job #2706557)
Utilizator | Data | 15 februarie 2021 12:13:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
#include <sstream>
using namespace std;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T;
cin >> T;
for(int i =1; i<=T; i++)
{
int a,b;
in >> a >> b;
int auxa =a;
int auxb = b;
a = max(auxa,auxb);
b = min(auxa,auxb);
//cout << a << " " <<b;
while(true)
{
if(a%b == 0)
{
out << b;
break;
}
else
{
int aux = a%b;
a = b;
b = aux;
}
}
}
return 0;
}