Playing with Paper -CodeForces - 527A

题意：欧几里德算法求最大公约数
gcd(a,b)=gcd(a%b,b)
AC代码：
#include <iostream>

using namespace std;
long long sum;

long long gcd(long long a, long long b) {
if (b != 0)
sum += a / b;
return b == 0 ? a : gcd(b, a % b);
}

int main() {
long long a, b;
while (cin >> a >> b) {
sum = 0;
gcd(a, b);
cout << sum << endl;
}
return 0;
}