Cod sursa(job #1197679)

Utilizator VolcomDaniel Dumitrascu Volcom Data 13 iunie 2014 11:52:58
Problema Algoritmul lui Euclid Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>

using namespace std;


struct num_pair
{
	int a;
	int b;
};


int cmmdc(num_pair& p) 
{
	int till;
	int divider;

	while(1)
	{
		if(!p.a)
		   return p.b;
		else if(!p.b)
		   return p.a;
		else
		{
			if(p.a > p.b)
			  p.a -= p.b;
			else
			  p.b -= p.a;
		}
	}
}



int main()
{
	std::ifstream is("euclid2.in");
	std::ofstream os("euclid2.out");

	int max;
	is >> max;

	num_pair* vect = new num_pair[max];

	for(int i = 0; i < max; ++i)
	{
		is >> vect[i].a;
		is >> vect[i].b;  
	}

	for(int i = 0; i < max; ++i)
	   os << cmmdc(vect[i]) << endl;

	delete vect;

	return 0;
}