题解 | 二叉树

//格式每输出一个进行换行

#include<iostream>
#include<cstdio>
using namespace std;
int Function(int a,int b){
    int ans=0;
    while(a!=b){
        if(a>b){
            a=a/2;
        }else{
            b=b/2;
        }
    }
    ans =a;
    return ans;
}
int main(){
    int x,y;
    while(scanf("%d %d",&x,&y) != EOF){
        cout<<Function(x,y)<<endl;
    }
    return 0;
}