#include <bits/stdc++.h>
using namespace std;
long long k,n,i,j,u,t,w,xp,xs,ax,ay,g;
int z,pp;
long long m,k1,k2,k3,k4;
vector<long long> x;
long long a[2000005];
long long b[2000005];
bool v[5000];
string s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
for(u=0;u<t;u++) {
cin >> n >> k;
if(k>n) {cout << "NIE\n"; continue;}
if(k==1) {
if(n==1) cout << "P\n";
if(n==2) cout << "PA\n";
if(n>2) cout << "NIE\n";
continue;
}
if(k==2) {
if(n==2) cout << "AA\n";
if(n==3) cout << "AAP\n";
if(n==4) cout << "AAPP\n";
if(n>4) cout << "NIE\n";
continue;
}
if(k==3) {
if(n==3) cout << "AAA\n";
if(n==4) cout << "AAAP\n";
if(n==5) cout << "AAAPA\n";
if(n==6) cout << "AAAPAP\n";
if(n==7) cout << "AAAPAPP\n";
if(n==8) cout << "AAAPAPPP\n";
if(n>8) cout << "NIE\n";
continue;
}
for(j=0;j<k;j++) cout << "A";
i=0;
s="";
for(i=0;i<k-2;i++)
s+="P";
s+="AP";
for(i=0;i<k-2;i++)
s+="A";
while(j<n) {
cout << s[(j-k)%(2*k-2)];
j++;
}
cout << '\n';
}
}
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 | #include <bits/stdc++.h> using namespace std; long long k,n,i,j,u,t,w,xp,xs,ax,ay,g; int z,pp; long long m,k1,k2,k3,k4; vector<long long> x; long long a[2000005]; long long b[2000005]; bool v[5000]; string s; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> t; for(u=0;u<t;u++) { cin >> n >> k; if(k>n) {cout << "NIE\n"; continue;} if(k==1) { if(n==1) cout << "P\n"; if(n==2) cout << "PA\n"; if(n>2) cout << "NIE\n"; continue; } if(k==2) { if(n==2) cout << "AA\n"; if(n==3) cout << "AAP\n"; if(n==4) cout << "AAPP\n"; if(n>4) cout << "NIE\n"; continue; } if(k==3) { if(n==3) cout << "AAA\n"; if(n==4) cout << "AAAP\n"; if(n==5) cout << "AAAPA\n"; if(n==6) cout << "AAAPAP\n"; if(n==7) cout << "AAAPAPP\n"; if(n==8) cout << "AAAPAPPP\n"; if(n>8) cout << "NIE\n"; continue; } for(j=0;j<k;j++) cout << "A"; i=0; s=""; for(i=0;i<k-2;i++) s+="P"; s+="AP"; for(i=0;i<k-2;i++) s+="A"; while(j<n) { cout << s[(j-k)%(2*k-2)]; j++; } cout << '\n'; } } |
English