题解 | #二叉树#
二叉树
https://www.nowcoder.com/practice/f74c7506538b44399f2849eba2f050b5
#include <stdio.h>
int BinaryTree(int m, int n) {
if (m <= n) {
return 1 + BinaryTree(m * 2, n) + BinaryTree(m * 2 + 1, n);
} else {
return 0;
}
}
int main() {
int m, n;
while (scanf("%d %d", &m, &n) != EOF) {
if (m == 0 && n == 0) break;
printf("%d\n", BinaryTree(m, n));
}
return 0;
}
