import sys
input = sys.stdin.readline
t = int(input())
out = []
# dane poczatkowe
db = {
1: {
1: "A",
2: "PA"
},
2: {
2: "AA",
3: "AAP",
4: "AAPP"
},
3: {
3: "AAA",
4: "AAAP",
5: "AAAPA",
6: "AAAPAP",
7: "PPPAPAA",
8: "AAAPAPPP"
}
}
for _ in range(t):
line = input().strip()
if not line:
continue
n, k = map(int, line.split())
if n < k:
print("NIE")
continue
if k <= 3:
if n in db[k]:
print(db[k][n])
else:
# długie słowo musi miec krótki palindrom
print("NIE")
else:
s = ["A"] * k
pattern = "PPAPAA"
for i in range(n - k):
s.append(pattern[i % 6])
print("".join(s))
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 42 43 44 45 46 47 48 49 50 51 52 | import sys input = sys.stdin.readline t = int(input()) out = [] # dane poczatkowe db = { 1: { 1: "A", 2: "PA" }, 2: { 2: "AA", 3: "AAP", 4: "AAPP" }, 3: { 3: "AAA", 4: "AAAP", 5: "AAAPA", 6: "AAAPAP", 7: "PPPAPAA", 8: "AAAPAPPP" } } for _ in range(t): line = input().strip() if not line: continue n, k = map(int, line.split()) if n < k: print("NIE") continue if k <= 3: if n in db[k]: print(db[k][n]) else: # długie słowo musi miec krótki palindrom print("NIE") else: s = ["A"] * k pattern = "PPAPAA" for i in range(n - k): s.append(pattern[i % 6]) print("".join(s)) |
English