[蓝桥杯2019初赛]矩形切割-找规律

代码如下：

#include <iostream>
using namespace std;

int main() {
	int a, b;
	int ans = 1;
	cin >> a >> b;
	while (1) {
		if (a == 1 && b == 1 || a == b)
			break;
		if ( a > b) {
			int c = b;
			b = a;
			a = c;
		}
		b = b - a;
		ans++;
	}
	cout << ans << endl;
	return 0;
}