defgcb(a,b):if b ==0:return a
return gcb(b,a%b)
a , b =list(map(int,input().split()))
c =0
count =0if a <b:
a,b = b,a
c = gcb(a,b)
count+=a//c
count+=b//c
print(count-2)
划分为相同大小的chocolate问题描述:思路:水题,本质就是求最大公约数代码如下:def gcb(a,b): if b ==0: return a return gcb(b,a%b)a , b = list(map(int,input().split()))c = 0count = 0if a <b: a,b = b,ac = gcb(a,b)count+=a//ccount+=b//cprint(count-2)...