import sys
input = sys.stdin.readline
def make_palindrome(k):
s = ['A'] * k
for i in range(k // 2):
s[i] = 'A'
s[k - 1 - i] = 'A'
if k % 2 == 0:
s[k // 2] = 'P'
return ''.join(s)
t = int(input())
out = []
for _ in range(t):
n, k = map(int, input().split())
if k > n:
out.append("NIE")
continue
if k == 1:
s = ''.join("AP"[i % 2] for i in range(n))
out.append(s)
continue
pal = make_palindrome(k)
left = 'P' if pal[0] == 'A' else 'A'
right = 'P' if pal[-1] == 'A' else 'A'
res = [left] + list(pal) + [right]
while len(res) < n:
res.append('A')
out.append(''.join(res[:n]))
print("\n".join(out))
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 34 35 36 37 38 39 40 41 | import sys input = sys.stdin.readline def make_palindrome(k): s = ['A'] * k for i in range(k // 2): s[i] = 'A' s[k - 1 - i] = 'A' if k % 2 == 0: s[k // 2] = 'P' return ''.join(s) t = int(input()) out = [] for _ in range(t): n, k = map(int, input().split()) if k > n: out.append("NIE") continue if k == 1: s = ''.join("AP"[i % 2] for i in range(n)) out.append(s) continue pal = make_palindrome(k) left = 'P' if pal[0] == 'A' else 'A' right = 'P' if pal[-1] == 'A' else 'A' res = [left] + list(pal) + [right] while len(res) < n: res.append('A') out.append(''.join(res[:n])) print("\n".join(out)) |
English