CCPC女生专场重现 B: 缺失的数据范围 (二分)

最新推荐文章于 2022-12-20 15:01:52 发布

sizaif

最新推荐文章于 2022-12-20 15:01:52 发布

阅读量427

点赞数

分类专栏：数据结构 ACM进阶之路文章标签： CCPC

本文链接：https://blog.csdn.net/sizaif/article/details/80536345

版权

ACM进阶之路同时被 2 个专栏收录

207 篇文章 7 订阅

订阅专栏

数据结构

13 篇文章 0 订阅

订阅专栏

123

地址: http://acm.hdu.edu.cn/showproblem.php?pid=6288

嗯嗯, 数据出的很好, 精度控制的非常不错卡 log 函数向上取整精度, 所以需要自己写 log2 函数 , 2 的多少次方接近 n

JAVA

import java.math.BigInteger;
import java.util.Scanner;
import java.lang.Math;
public class Main {
    public static BigInteger a, b, k;
    public static BigInteger one = BigInteger.ONE;
    public static BigInteger zero = BigInteger.ZERO;
    public static BigInteger two = BigInteger.valueOf(2);

    public static void main(String[] args) {

        int t;
        Scanner cin = new Scanner(System.in);
        t = cin.nextInt();
        while (t-- != 0) {
            a = cin.nextBigInteger();
            b = cin.nextBigInteger();
            k = cin.nextBigInteger();
            BigInteger l = one;
            BigInteger r =  new BigInteger("1000000000000000000000");
            BigInteger ans = one;
            while (l.compareTo(r) <= 0) {
                BigInteger mid = l.add(r).divide(two);

                BigInteger q = mid.pow(a.intValue());  // n^a

                int cot = 1;   // log2n
                BigInteger log = two;
                while (log.compareTo(mid) < 0) {
                    cot++;
                    log = log.multiply(two);
                }
                BigInteger p = q.multiply( BigInteger.valueOf(cot).pow(b.intValue()) );   // log2n ^b

                if( p.compareTo(k)<=0)
                {
                    l = mid.add(one);
                    ans = mid;
                }
                else
                {
                    r = mid.subtract(one);
                }
            }
            //System.out.println(l.subtract(one));
            System.out.println(ans);
        }
    }
}