#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)
const int inf = 1e10;
double P; int n;
void solve(bool sub1){
if(sub1){
cout << 'Q' << ' ';
for(int i = 0; i < n; i++) cout << 1;
cout << endl;
char x;
cin >> x;
cout << "A ";
for(int i = 0; i < n; i++)cout << (x == 'P');
cout << flush;
}else{
}
}
signed main() {
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);cout.tie(nullptr);
int tt = 1;
cin >> tt >> P >> n;
bool sub1 = (tt == 1);
while(tt--){
solve(sub1);
};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |