题目描述
链接:https://www.nowcoder.com/questionTerminal/f74c7506538b44399f2849eba2f050b5 来源:牛客网 #include<stdio.h> int countNode(int n,int m){ if(m>n) return 0; return countNode(n,2*m)+countNode(n,2*m+1)+1; } int main(){ int m,n; while(scanf("%d%d",&m,&n)!=EOF){ if(m==0&&n==0) break; printf("%d\n",countNode(n,m)); } return 0; }