zoukankan      html  css  js  c++  java
  • poj 2309 BST(数学题)

    BST
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 8440   Accepted: 5093

    Description

    Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries. 

    Input

    In the input, the first line contains an integer N, which represents the number of queries. In the next N lines, each contains a number representing a subtree with root number X (1 <= X <= 231 - 1).

    Output

    There are N lines in total, the i-th of which contains the answer for the i-th query.

    Sample Input

    2
    8
    10
    

    Sample Output

    1 15
    9 11


    ==================================================================
    这题就是Lowbit函数的使用,理解了Lowbit,这题就很容易了
    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    
    #define MAxx 1000
    
    int Lowbit(int x)
    {
        return x&(-x);
    }
    int main()
    {
        int i,j,n,m;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%d",&m);
            int cas=Lowbit(m);
            printf("%d %d
    ",m-cas+1,m+cas-1);
        }
        return 0;
    }
    

      

  • 相关阅读:
    Linux_进程之间的通信
    Linux_控制作业(管理)
    Linux_进程管理相关命令
    Linux_进程管理的基本概述
    文本编辑_Vim&Vi
    Linux_权限管理理论概述
    Linux_用户和组管理
    Linux_ACL文件访问控制列表
    72. VUE axios 配置信息相关
    71. VUE axios 发送并发请求(多个)
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3837742.html
Copyright © 2011-2022 走看看