#include <bit/stdc++.h>
using namespace std;
long long a,b,s,ans;
int main()
{
	cin >> a >> b;
	int i = 1;
	while (1)
	{
		if (a == 0 || b == 0)
		{
			cout >> s;
			return 0;
		}
		if (a > b) s += a / b,a %= b;
		else s += b / a,b %= a;//辗转相除
	}
return 0;
}

复制=CE

看完题目后，我们可以用最大公倍数进行解答。程序如下： #include<bits/stdc++.h>

using namespace std;

long long a,b,res=0;

int main()

{

cin>>a>>b;

long long x=a,y=b;

while(x!=0&&y!=0)

{

if(x<y)swap(x,y);

res+=x/y;

x=x%y;

}

cout<<res;

return 0;

}