343A - Rational Resistance - CodeForces Solution

ab=list(map(int, input().split()))
ma,mi=max(ab[0],ab[1]),min(ab[0],ab[1])
count = 0
while(mi>0):
    C = ma//mi
    ma = ma%mi
    ma,mi = mi,ma
    count = count + C
print(count)