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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
// g++ pal.cpp  && ./a.out < test/by_me/1.in
#include <iostream>
#include <vector>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t, n, k;
    string result;

	cin >> t;

    for (int tt = 0; tt < t; tt++)
    {
        cin >> n >> k;

        if (n == 1)
        {
            result = "A";
        }
        else if (n == 2)
        {
            if (k == 1)
                result = "AP";
            else
                result = "AA";
        }
        else if (n == 3 or n == 4)
        {
            if (k == 1)
                result = "NIE";
            else
            {
                result = string(k, 'A') + string(n-k, 'P');
                // result = "A"*k + "P"*(n-k);
            }
        }
        else if (n == 5 or n == 6)
        {
            if (k < 3)
                result = "NIE";
            else
            {
                result = string(k, 'A') + string(n-k, 'P');
                // result = "A"*k + "P"*(n-k);
            }
        }
        else if (n == 7 or n == 8)
        {
            if (k < 3)
                result = "NIE";
            else
            {
                string non_palindrome_pattern = "AAPAPPP";
                result = string(k, 'A');
                // result = "A"*k;
                for (int i=0; i<n-k; i++)
                    result += non_palindrome_pattern[(i+2) % non_palindrome_pattern.size()];
            }
        }
        else
        {
            if (k < 4)
                result = "NIE";
            else
            {
                string non_palindrome_pattern = "AAPAPP";
                result = string(k, 'A');
                // result = "A"*k;
                for (int i=0; i<n-k; i++)
                    result += non_palindrome_pattern[(i+2) % non_palindrome_pattern.size()];
            }
        }

        cout << result << endl;
    }
}