蓝桥杯寒假训练2

n = int(input())
mix = [[0] * n for i in range(n)]

if n % 2 != 0:
    mix[0][n // 2] = 1
    k = 2
    i = 0
    j = n // 2
    while k <= n ** 2:
        if i == 0 and j != n - 1:
            if mix[n - 1][j + 1] == 0:
                mix[n - 1][j + 1] = k
                i = n - 1
                j = j + 1
            else:
                mix[i + 1][j] = k
                i = i + 1
        elif i != 0 and j == n - 1:
            mix[i - 1][0] = k
            i = i - 1
            j = 0
        elif i == 0 and j == n - 1:
            mix[i + 1][j] = k
            i = i + 1
        elif i != 0 and j != n - 1:
            if mix[i - 1][j + 1] == 0:
                mix[i - 1][j + 1] = k
                i = i - 1
                j = j + 1
            else:
                mix[i + 1][j] = k
                i = i + 1
        k += 1

for i in range(n):
    for j in range(n):
        if j != n - 1:
            print(mix[i][j], end=' ')
        else:
            print(mix[i][j])

思路：暴力枚举

n = int(input())
end = 0
i = 1
while True:
    n -= i
    if n < 0:
        for k in range(n + i):
            end += i
        break
    else:
        for k in range(i):
            end += i
    i += 1
    if n == 0:
        break
print(end)

思路：枚举

n,k=map(int,input().split())
exp=[i for i in range(n)] 
for i in range(n):
    val = i * k % n
    exp[val] = min(i,exp[val])
for i in range(1,n):
    exp[i]=min(exp[i-1]+1,exp[i-k]+1,exp[i])
print(max(exp))

import itertools

n, d, k = map(int, input().split())
ans = []
rp = []
exp = [[0] * 2 for i in range(n)]
for i in range(n):
    ts, id = map(int, input().split())
    exp[i][0] = ts
    exp[i][1] = id
    rp.append(id)
exp.sort(key=lambda ele: ele[1])
result = []
for key, group in itertools.groupby(exp, key=lambda x: x[1]):
    group_sorted = sorted(group, key=lambda x: x[0])
    result.extend(group_sorted)

res = [1]
t = 0
if n > 1:
    for i in range(1, n):
        if result[i][1] != result[i - 1][1]:
            if res[-1] >= k:
                ans.append(result[i - 1][1])
            res = [1]
        else:
            if result[i][0] - result[i - 1][0] <= d:
                res[-1] += 1
    if res[-1] >= k:
        ans.append(result[-1][1])
else:
    ans.append(result[0][1])

ans = sorted(list(set(ans)))
for i in range(len(ans)):
    print(ans[i])

思路：枚举