[Zerojudge]a024: 最大公因數(GCD)

利用輾轉相除法即可過關。

[C++](6ms, 698KB)

	#include<iostream>
	using namespace std;
	int main()
	{
	int a, b;
	while( cin >> a >> b )
	{
	while( (a%=b) && (b%=a) );
	cout << a+b << endl;
	}
	return 0;
	}

view raw Zerojudgea024.cpp hosted with ❤ by GitHub