Pagini recente » Cod sursa (job #716929) | Cod sursa (job #1746899) | Cod sursa (job #2331396) | Cod sursa (job #699748) | Cod sursa (job #2206857)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
void Read(vector <pair <int, int> >& list, int& length)
{
pair <int, int> prop;
fin >> length;
for (int i = 0; i < length / 4; i++)
{
fin >> prop.first >> prop.second;
list.push_back(prop);
fin >> prop.first >> prop.second;
list.push_back(prop);
fin >> prop.first >> prop.second;
list.push_back(prop);
fin >> prop.first >> prop.second;
list.push_back(prop);
}
}
int GetDivisor(pair <int, int> PairOfNumbers)
{
while (PairOfNumbers.first != PairOfNumbers.second)
{
if (PairOfNumbers.first < PairOfNumbers.second)
{
PairOfNumbers.second -= PairOfNumbers.first;
}
else
{
PairOfNumbers.first -= PairOfNumbers.second;
}
}
return PairOfNumbers.first;
}
int main()
{
vector <pair <int, int> > list;
int length;
Read(list, length);
for (int i = 0; i < length; i++)
{
fout << GetDivisor(list.at(i)) << '\n';
}
return 0;
}