314完全二叉树的子树

 1 #include<stdio.h>
 2 int Count(int m,int n);
 3 
 4 int main()
 5 {
 6     int m,n;
 7     
 8     while(1)
 9     {
10         scanf("%d%d",&m,&n);
11         
12         if(m==0&&n==0) break;
13     
14         int numberOfChild=0;
15         numberOfChild=Count(m,n);
16         
17         printf("%d\n",numberOfChild);
18     }
19     return 0;
20 }
21 
22 int Count(int m,int n)//n is the total
23 {
24     int numberofVertex;
25     if(m>n) numberofVertex=0;
26     else
27     {
28         numberofVertex=Count(m*2,n)+Count(m*2+1,n)+1;
29     }
30     return numberofVertex;
31 }