def solve(n, k):
# n = k
if n==k:
return "A"*n
# k = 1
if k == 1:
if n == 1: return "A"
if n == 2: return "AP"
return "NIE"
# k = 2
if k == 2:
if n == 2: return "AA"
if n == 3: return "AAP"
if n == 4: return "AAPP"
return "NIE"
# k = 3
if k == 3:
s3 = "AAAPAPPP"
if n <= 8:
return s3[:n]
return "NIE"
# k = 4
if k == 4:
if n < 4:
return "NIE"
w = "PAAPPA" * ((n // 6) + 1)
return w[:n]
# k >= 5
if k >= 5:
if n < k:
return "NIE"
w = "PAAPPA" * ((n // 6) + 1)
return ("A" * k) + w[:n - k]
t = int(input())
for _ in range(t):
n,k = [int(x) for x in input().split()]
print(solve(n,k))
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 | def solve(n, k): # n = k if n==k: return "A"*n # k = 1 if k == 1: if n == 1: return "A" if n == 2: return "AP" return "NIE" # k = 2 if k == 2: if n == 2: return "AA" if n == 3: return "AAP" if n == 4: return "AAPP" return "NIE" # k = 3 if k == 3: s3 = "AAAPAPPP" if n <= 8: return s3[:n] return "NIE" # k = 4 if k == 4: if n < 4: return "NIE" w = "PAAPPA" * ((n // 6) + 1) return w[:n] # k >= 5 if k >= 5: if n < k: return "NIE" w = "PAAPPA" * ((n // 6) + 1) return ("A" * k) + w[:n - k] t = int(input()) for _ in range(t): n,k = [int(x) for x in input().split()] print(solve(n,k)) |
English