Pagini recente » Algoritmiada 2009 - Clasament Runda 1, Studenti | Rating Armand Nicolicioiu (ArmandNM) | Arhiva de probleme | Rating FMI - Doru Musuroi (dorumusuroi) | Cod sursa (job #3288319)
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int GCD(int first, int second)
{
while (second != 0)
{
int temp = first % second;
first = second;
second = temp;
}
return first;
}
int main()
{
int cases;
fin >> cases;
int first, second;
for (int i = 0; i < cases; i++)
{
fin >> first >> second;
fout << GCD(first, second) << "\n";
}
}