题解 | #二叉树#

import java.io.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
        String line = br.readLine();
        while(line != null){
        String [] s =  line.split(" ");
        long a = Long.parseLong(s[0]);
        long b = Long.parseLong(s[1]);
        while(a!=b){
            if(a>b){
                a=a/2;
            }
            else{
                b=b/2;
            }
        }
        writer.write(Long.toString(a));
        writer.newLine();
        line = br.readLine();
        }
        //1-n的完全二叉树找最近公共父结点
        writer.flush();
    }
}