// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
using namespace std;
#define int long long
#define endl "\n";
const int N=2e5+5;
const int M=1e9+7;
int n;
double p;
void solve()
{
string s,r;
for (int i=0;i<n;i++){
s+='0';
r+='0';
}
for (int i=0;i<n;i++){
s[i]='1';
cout << "Q " << s << endl;
char u;
cin >> u;
if (u=='P'){
r[i]='1';
}
s[i]='0';
}
cout << "A " << r << endl;
char e;
cin >> e;
if (e=='C'){
return;
}
else{
exit(0);
}
}
signed main()
{
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed<<setprecision(9);
int t=1;
cin >> n >> p >> t;
for (int _=1;_<=t;_++){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |