Codeforces Round 925 (Div. 3)（A~E）python

A. Recovering a Small String

Problem - A - Codeforces

暴力，字符串

每个位置至少分配1，剩余的优先向后分配

t = int(input())
for _ in range(t):
    n = int(input())
    res = [1, 1, 1]
    n -= 3
    i = 2
    while n > 0 and i >= 0:
        now = min(n, 25)
        res[i] += now
        n -= now
        i -= 1
    for i in res:
        print(chr(i-1+ord("a")), end="")
    print()

B. Make Equal