-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBINTREE.c
67 lines (67 loc) · 1.2 KB
/
BINTREE.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#define gc getchar
#define ll long long int
#define M 1000000007
#define scan(t) t=input()
inline ll input() {
char c = gc();
while(c<'0' || c>'9') c = gc();
ll ret = 0;
while(c>='0' && c<='9') {
ret = 10 * ret + c - 48;
c = gc();
}
return ret;
}
int main()
{
ll t,i,a,b,x,y,count;
scan(t);
while(t--)
{
count=0;
scan(a);
scan(b);
x=log2(a);
y=log2(b);
if(x<=y)
{
for(i=y;i>x;i--)
{
b/=2;
count++;
}
if(a!=b)
for(i=x;i>=0;i--)
{
a/=2;
b/=2;
count+=2;
if(a==b)
break;
}
}
else
{
for(i=x;i>y;i--)
{
a/=2;
count++;
}
if(a!=b)
for(i=y;i>=0;i--)
{
a/=2;
b/=2;
count+=2;
if(a==b)
break;
}
}
printf("%lld\n",count);
}
return 0;
}