問題

022 - Cubic Cake（★2）

AtCoder is a programming contest site for anyone from beginners to experts. We hold weekly programmi

方針

• 最大公約数を使う
• 最大公約数で割った商の-1回ずつ

python
import math
 
a, b, c = map(int, input().split())
ab_gcd = math.gcd(a, b)
gcd = math.gcd(ab_gcd, c)
 
num_a = ( a // gcd ) -1
num_b = ( b // gcd ) -1
num_c = ( c // gcd ) -1

print(int(num_a  + num_b + num_c))