Cod sursa(job #2706564)
Utilizator | Data | 15 februarie 2021 12:24:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.99 kb |
#include <iostream>
#include <fstream>
#include <sstream>
using namespace std;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T;
in >> T;
int v[T][2];
for(int i=1; i<=T; i++)
for(int j = 1; j<=2; j++)
{
in >> v[i][j];
if(j==2)
{
int auxa =v[i][1];
int auxb = v[i][2];
int a = max(auxa,auxb);
int b = min(auxa,auxb);
//cout << a << " " <<b;
a = a-b;
while(true)
{
if(a%b == 0)
{
out << b << endl;
break;
}
else
{
int aux = a%b;
a = b;
b = aux;
}
}
}
}
return 0;
}