#include <bits/stdc++.h>
#define div /
#define ll long long
#define fore(i, l, r) for(int i=int(l); i<int(r); i++)
#define sz(a) int((a).size())
using namespace std;
const int INF = 1e9;
const int MX = 5e5 + 23;
const int MOD = 1000000007;
const int MAX_N = 5e5+23;
const int N = 1e6;
void solve() {
int n,t;
float p;
cin >> n >> p >> t;
int ans[n+1];
memset(ans,0,sizeof ans);
fore(i,0,n) {
cout << "Q ";
fore(j,0,n) {
if(j == i)
cout << "1";
else
cout << "0";
}
cout << endl;
char odg; cin >> odg;
if(odg == 'P')
ans[i] = 1;
}
cout << "A ";
fore(i,0,n)
cout << ans[i];
cout << endl;
}
int main() {
ios::sync_with_stdio(false);
int t=1;
while(t--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Unexpected end of file - token expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
344 KB |
Output is correct |
2 |
Correct |
20 ms |
344 KB |
Output is correct |
3 |
Correct |
27 ms |
344 KB |
Output is correct |
4 |
Correct |
19 ms |
344 KB |
Output is correct |
5 |
Correct |
19 ms |
344 KB |
Output is correct |
6 |
Correct |
20 ms |
344 KB |
Output is correct |
7 |
Correct |
20 ms |
344 KB |
Output is correct |
8 |
Correct |
19 ms |
340 KB |
Output is correct |
9 |
Correct |
27 ms |
344 KB |
Output is correct |
10 |
Correct |
23 ms |
344 KB |
Output is correct |
11 |
Correct |
19 ms |
344 KB |
Output is correct |
12 |
Correct |
20 ms |
344 KB |
Output is correct |
13 |
Correct |
19 ms |
344 KB |
Output is correct |
14 |
Correct |
19 ms |
344 KB |
Output is correct |
15 |
Correct |
19 ms |
344 KB |
Output is correct |
16 |
Correct |
19 ms |
344 KB |
Output is correct |
17 |
Correct |
20 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
19 ms |
344 KB |
Unexpected end of file - token expected |
2 |
Halted |
0 ms |
0 KB |
- |