# 2014年山东省第五届ACM--Full Binary Tree （满二叉树）

Full Binary Tree

Time Limit: 2000MS Memory limit: 65536K

In computer science, a binary tree is a tree data structure in which each node has at most two children. Consider an infinite full binary tree (each node has two children except the leaf nodes) defined as follows. For a node labelled v its left child will be labelled 2 * v and its right child will be labelled 2 * v + 1. The root is labelled as 1.

You are given n queries of the form i, j. For each query, you have to print the length of the shortest path between node labelled i and node labelled j.

First line contains n(1 ≤ n ≤ 10^5), the number of queries. Each query consists of two space separated integers i and j(1 ≤ i, j ≤ 10^9) in one line.

For each query, print the required answer in one line.

5

1 2

2 3

4 3

1024 2048

3214567 9998877

1

2

3

1

44

2014年山东省第五届ACM大学生程序设计竞赛

``````#include <stdio.h>
int main()
{
int i,j;
int n,m;
int T;
scanf("%d",&T);
while(T--)
{
int count=0;
scanf("%d %d",&n,&m);
while(n!=m)
{
if(n>m)
n/=2;
else
m/=2;
count++;
}
printf("%d\n",count);
}

return 0;
}  ``````
原文作者：满二叉树
原文地址: https://blog.csdn.net/kavu1/article/details/51113217
本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。