import sys
def countNode(m,n):
if m > n: # 子树不存在
return 0
else: # 子树结点存在
return countNode(m * 2, n) + 1 +countNode(m * 2 + 1, n)
for line in sys.stdin:
m, n = map(int, line.strip().split())
if m == 0 == n:
continue
print(countNode(m, n))
KY85 二叉树
最新推荐文章于 2024-06-21 13:03:53 发布