2014年山东省第五届ACM大学生程序设计竞赛 F-Full Binary Tree

#include<iostream>
using namespace std;
int main(void)
{
	int T;cin>>T;
	while(T--)
	{
		int i,j;
		cin>>i>>j;
		long long ans=0;
		while(i!=j)
		{
			ans++;
			if(i<j)
			{
				if(j&1) j--;
				j>>=1;
			}
			else
			{
				if(i%1) i--;
				i>>=1;
			}

		}
		cout<<ans<<endl;
	}
}

Full Binary Tree

  2000 ms         65536 KiB

Submit Status My Status  Origin

Description

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.

 

Input

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.

 

Output

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

 

Sample

Input

Copy5
1 2
2 3
4 3
1024 2048
3214567 9998877

Output

Copy1
2
3
1
44

Hint

 

Source

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