// Programmieren 1, Praktikum 3, Aufgabe 4
// Sven Eisenhauer
// 17.11.2004
//
// file: main.cpp
//
// purpose: find the greatest common divisor of two numbers, recursive...          
//          
//

#include <iostream>
using std::cin;
using std::cout;
using std::endl;

int gcd(int,int);

int main()
{
	int number1,
		number2;

	cout << "1st number: ";
	cin >> number1;
	cout << "2nd number: ";
	cin >> number2;

	cout <<endl<<"Greatest common divisor: "<< gcd(number1,number2) << endl;

	return 0;
}

int gcd(int x, int y)
{
	if (0 == y)
	{
		return x;
	}
	else
	{
		return gcd (y,x%y);
	}
}