//二叉树 #include<stdio.h> int common(int x,int y) { if(x==y) return x; if(x>y) common(x/2,y); else common(x,y/2); } int main() { int m,n; scanf("%d%d",&m,&n); printf("%d ",common(m,n)); return 0; }
//二叉树 #include<stdio.h> int common(int x,int y) { if(x==y) return x; if(x>y) common(x/2,y); else common(x,y/2); } int main() { int m,n; scanf("%d%d",&m,&n); printf("%d ",common(m,n)); return 0; }