SPOJ - PHT

最新推荐文章于 2018-07-09 20:34:10 发布

祖国大花朵

最新推荐文章于 2018-07-09 20:34:10 发布

阅读量254

点赞数

分类专栏：二分

本文链接：https://blog.csdn.net/qq_37503046/article/details/73692701

版权

二分专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Pigeon SSNA want to build a tower with some wood walls. Let's describe the tower they want to make:

A Tower can consist of different number of level.
If a tower contain L levels then 1^st level must contain L holes , 2^nd level L-1 , 3^rd level L-2 ….. L level contain 1 hole .
Each room contain 3 wood walls.

See the picture below:


3 Level Tower	4 Level tower

Now pigeon SSNA has n wood walls. What is maximum number of level he can made.

Input

Input starts with an integer T (≤ 100000), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10¹²)

Output

For each case of input you have to print the case number and expected answer.

Sample Input

Output for Sample Input

2
15
24

题目大意：

给你n个木棍，求能搭成多少层的塔

解题思路：

很简单，简单二分一下就好，但是注意数据太大爆long long

输入的时候要用lld，用I64d会RE(比赛的时候错了好几发，哇，贼赤激)

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int check(int x){
    double res = x * 3;
    res += (double)(x - 1)*(2 + 2*(x-1))/2.0;
    if(res > n)
        return 0;
    return 1;
}

int32_t main(){
    int T, icase = 1;
    scanf("%lld", &T);
    while(T--){
        scanf("%lld", &n);
        int l = 0, r = 1e12;
        for(int i = 0; i < 500; i++){
            int mid = (l + r) >> 1;
            if(check(mid)){
                l = mid;
            }
            else{
                r = mid;
            }
        }
        printf("Case %lld: %lld\n",icase++, l);
    }
}