4.序号乘方

最新推荐文章于 2021-10-02 23:53:15 发布

黑夜中坚持

最新推荐文章于 2021-10-02 23:53:15 发布

阅读量450

点赞数 1

分类专栏：针对lcy编程文章标签：算法

本文链接：https://blog.csdn.net/qq_26496077/article/details/103241134

版权

针对lcy编程专栏收录该内容

42 篇文章 4 订阅

订阅专栏

Description
There are Infinite People Standing in a row, indexed from 1.A person having index ‘i’ has strength of (i*i).You have Strength ‘P’. You need to tell what is the maximum number of People You can Kill With your Strength P.You can only Kill a person with strength ‘X’ if P >= ‘X’ and after killing him, Your Strength decreases by ‘X’.

Input
First line contains an integer ‘T’ - the number of testcases,Each of the next ‘T’ lines contains an integer ‘P’- Your Power.Constraints:1<=T<=100001<=P<=1000000000000000

Output
For each testcase Output The maximum Number of People You can kill.

Sample Input 1
1
14

Sample Output 1
3

def solution(number):
    k = 1
    while (k * (k + 1) * (2 * k + 1)) // 6 <= number:
        k += 1
    return k - 1


if __name__ == '__main__':
    n = int(input())
    for i in range(n):
        number = int(input())
        result = solution(number)
        print(result)