忠诚的骑士

思路

分组的思想，判断输入的数字应该在第几组，然后判断该数字在当前分组的第几个位置，然后进行求和

image-20220321202055824

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
def cal(n, index):
    sum = 0
    for i in range(1, n):
        sum += i * i
    sum += n * index
    return sum


if __name__ == '__main__':
    k = int(input())
    # if k == 1:
    #     print(1)
    p = k
    s = k * (k + 1) // 2
    while k <= s:
        p = p - 1
        s = p * (p + 1) // 2
    # 检测在第三组第几个位置
    nums = []
    # print(nums)
    # print('p =', p)
    # print('s =', s)
    num = p * (p + 1) // 2 + 1
    for i in range(p + 1):
        nums.append(num)
        num += 1

    # print(nums)
    # print('第', nums.index(k) + 1)

    # 计算金币总数
    # print('金币总数：', cal(p + 1, nums.index(k) + 1))
    print(cal(p + 1, nums.index(k) + 1))