Algorithm/ct/l1/8-平衡数.py

18 lines
262 B
Python

def f(x):
y = 1
for j in x:
y *= int(j)
return y
n = input()
flag = True
for i in range(1, len(n)):
left, right = n[:i], n[i:]
if f(left) == f(right):
flag = False
print("YES")
break
if flag:
print("No")