zoukankan      html  css  js  c++  java
  • Full Binary Tree

    Time Limit: 2000MS Memory limit: 65536K
    题目描述
    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.

    输入
    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.

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

    示例输入

    5
    1 2
    2 3
    4 3
    1024 2048
    3214567 9998877

    示例输出

    1
    2
    3
    1
    44


    来源

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

    大神的代码竟然是这样:

    #include <stdio.h>  
    int main()  
    {  
        int i,j;  
        int n,m;  
        int T;  
        scanf("%d",&T);  
        while(T--)  
        {  
            int count=0;  
            scanf("%d %d",&n,&m);  
            while(n!=m)  
            {  
                if(n>m)  
                    n/=2;  
                else  
                    m/=2;  
                count++;  
            }  
            printf("%d
    ",count);  
        }  
        return 0;  
    }  

    佩服佩服 

  • 相关阅读:
    python += 与=的区别
    django 使用框架下auth.models自带的User进行扩展增加字段
    基于服务器版centos7的Hadoop/spark搭建
    疑难汉字查询网
    中国地情网
    河南省高校社会科学研究信息网
    字由网站
    东方语言学
    北朝墓志地名查询
    子午书简——电子书网站
  • 原文地址:https://www.cnblogs.com/coder-tcm/p/8627478.html
Copyright © 2011-2022 走看看