[BAEKJOON ONLINE JUDGE] 7113번 : Rectangle

시간 제한 : 1 초

 

메모리 제한 : 128 MB

 

문제

Vilibald has decided to cut a right-angled checked page of size n×m cells into squares. First of all he cut off the largest possible square using a straight cut. Then he took away the square and repeated the action with the remaining rectangle. In this way (all the time cutting off the largest possible square) Vilibald continued cutting until the remaining rectangle was a square.

Your task is to write a program that for n and m values (n<10000, m<10000) given in the input data computes, how many squares Vilibalds obtained by cutting the rectangle in the way described above.

---

a, b = map(int, input().split(" "))

cnt = 0
while True:
    if a == b:
        cnt += 1
        break
    
    if a == max(a, b):
        a -= b
    else:
        b -= a
    cnt += 1

print(cnt)