#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;
void coutTab(int* tab,int n){
loop(i,0,n){
cout<<tab[i]<<" ";
}
cout<<"\n";
}
template<class T> void coutVec(vector<T> tab){
for(T t : tab){
cout<<t<<" ";
}
cout<<"\n";
}
//------------------------------------------
string sol="PPAPAA"; // PPAPAAPPAPAAPPAPAA
string sol3="AAAPAPPP";
string solve(int n, int k){
if(n==1 && k == 1) return "A";
if(n==2 && k == 1) return "AP";
if(n==2 && k == 2) return "AA";
if(n==3 && k == 2) return "APP";
if(n==3 && k == 3) return "APA";
if(n==4 && k == 2) return "AAPP";
if(k == 1) return "NIE";
if(k == 2) return "NIE";
if(k == 3) {
if(n>8) return "NIE";
string s;
loop(i,0,n) s.pb(sol3[i]);
return s;
}
string s;
loop(i,0,k) s.pb('A');
loop(i,k,n) s.pb(sol[(i-k)%6]);
return s;
}
int main(){
ios_base::sync_with_stdio(0);
int t,n,k;
cin>>t;
while(t--){
cin>>n>>k;
pln(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 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 | #include<bits/stdc++.h> #define VAR(i,n) __typeof(n) i = (n) #define loop(i,j,s) for(int i=j;i<s;i++) #define loopback(i,j,s) for(int i=j;i>=s;i--) #define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++) #define pln( x ) cout << x << "\n" #define ps( x ) cout << x << " " #define entr cout << "\n" #define pcnt(i) __builtin_popcount(i) #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second #define SIZE(c) (c).size() #define ALL(c) (c).begin(), (c).end() using namespace std; typedef vector<int> VI; typedef pair<int, int> PII; typedef vector<vector<int> > VVI; const int INFTY=20000000; const int MAX=500100; const int MOD=10000000; void coutTab(int* tab,int n){ loop(i,0,n){ cout<<tab[i]<<" "; } cout<<"\n"; } template<class T> void coutVec(vector<T> tab){ for(T t : tab){ cout<<t<<" "; } cout<<"\n"; } //------------------------------------------ string sol="PPAPAA"; // PPAPAAPPAPAAPPAPAA string sol3="AAAPAPPP"; string solve(int n, int k){ if(n==1 && k == 1) return "A"; if(n==2 && k == 1) return "AP"; if(n==2 && k == 2) return "AA"; if(n==3 && k == 2) return "APP"; if(n==3 && k == 3) return "APA"; if(n==4 && k == 2) return "AAPP"; if(k == 1) return "NIE"; if(k == 2) return "NIE"; if(k == 3) { if(n>8) return "NIE"; string s; loop(i,0,n) s.pb(sol3[i]); return s; } string s; loop(i,0,k) s.pb('A'); loop(i,k,n) s.pb(sol[(i-k)%6]); return s; } int main(){ ios_base::sync_with_stdio(0); int t,n,k; cin>>t; while(t--){ cin>>n>>k; pln(solve(n,k)); } } |
English