#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
void solve()
{
ll n, k;
cin >> n >> k;
ll x = max((n - 1) / 6, 0ll);
if (k < max((n-2*x+1) / 2, 2*x+1)) {
cout << "NIE" << endl;
return;
}
string mid = "";
for (int i = 0; i < x; ++i) {
mid += "PA";
}
string result = "";
for (int i = 0; i < k; ++i) {
result += "A";
}
result += mid;
while (result.size() < n) {
result += "P";
}
cout << string(result.begin(), result.begin() + n) << endl;
}
int main()
{
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
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 | #include <bits/stdc++.h> #define pb push_back using namespace std; typedef long long ll; typedef vector<ll> vll; void solve() { ll n, k; cin >> n >> k; ll x = max((n - 1) / 6, 0ll); if (k < max((n-2*x+1) / 2, 2*x+1)) { cout << "NIE" << endl; return; } string mid = ""; for (int i = 0; i < x; ++i) { mid += "PA"; } string result = ""; for (int i = 0; i < k; ++i) { result += "A"; } result += mid; while (result.size() < n) { result += "P"; } cout << string(result.begin(), result.begin() + n) << endl; } int main() { ios_base::sync_with_stdio(0); int t; cin >> t; while (t--) { solve(); } } |
English