HDOJ 4577

最新推荐文章于 2019-07-18 15:39:58 发布

XMzhou

最新推荐文章于 2019-07-18 15:39:58 发布

阅读量698

点赞数

分类专栏： HDOJ 文章标签： ACM JAVA

本文链接：https://blog.csdn.net/acm_xmzhou/article/details/9930057

版权

HDOJ 专栏收录该内容

94 篇文章 0 订阅

订阅专栏

X-Boxes

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 281 Accepted Submission(s): 98

Problem Description

Crazygirl is a crazy fan of XBOX games. Today, she’s here middle in a competition, in which the winner will be rewarded with an opportunity of working in the XBOX Company as a game testing player. Now, here comes the final game. As Cazygirl get a draw with the other competitor, Lich King, she must beat Lich this time.
The game is quite simple. There are n balls numbered from 1 to n and k boxes B ₁, B ₂,…, B _k satisfying following conditions:
1.  With any ball x in box B _i, there must be ball 2x in box B _i+1 if there is a box B _i+1;
2.  With any ball x in box B _i, there must be ball y in box B _i-1 satisfying 2y=x if there is a box B _i-1;
3.  You can’t put a ball in two different boxes at the same time;
4.  Your score is the number of balls in box B ₁;
5.  The player who get the highest score win the game of course.
So, you should tell Crazygirl the highest score she can get.

Input

The first line is the number of test cases.
Each test case has one line containing two integers n and k, meaning that there are n balls and k boxes. ( 1≤n≤10 ¹⁰⁰⁰⁰, 2≤k≤25 )

Output

For each test case, output one line that contains an integer equals to the highest score you can get.

Sample Input

Sample Output

Source

2013ACM-ICPC杭州赛区全国邀请赛

参考了一位大神的写法，看来我的JAVA水平还是有待加强啊！

import java.io.*;
import java.util.*;
import java.math.*;
/**
 *
 * @author XM_zhou
 */
public class Main {
    public static void main(String[] args)
    {
        Scanner cin = new Scanner (new BufferedInputStream(System.in));
        int k , T;
        T = cin.nextInt();
        while(T>0)
        {
            T--;
                BigInteger n = cin.nextBigInteger();
                k = cin.nextInt();
                int tmp = (1 << k);
                BigInteger ans = BigInteger.ZERO;
                n = n.multiply(BigInteger.valueOf(2));
                while(n.compareTo(BigInteger.ZERO) > 0)
                {
                    n = n.divide(BigInteger.valueOf(tmp));
                    BigInteger tt = n.add(BigInteger.ONE).divide(BigInteger.valueOf(2));
                    ans = ans.add(tt);
                }
                System.out.println(ans);
                
        }
      
    }
}