0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-08 14:18:47 +00:00

E - Omkar and Duck

https://codeforces.com/contest/1392/submission/190463285
This commit is contained in:
Baoshuo Ren 2023-01-25 16:33:11 +08:00
parent 99a1b17cff
commit 2a47d3c445
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A

47
Codeforces/1392/E/E.cpp Normal file
View File

@ -0,0 +1,47 @@
#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 30;
int n, q;
long long a[N][N];
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << ((i & 1ll) << (i + j)) << ' ';
}
cout << endl;
}
cout << std::flush;
cin >> q;
while (q--) {
long long x;
cin >> x;
int xx = 0, yy = 0;
cout << 1 << ' ' << 1 << endl;
for (int i = 1; i <= n * 2 - 2; i++) {
if (((x >> i) & 1) == (xx & 1)) yy++;
else xx++;
cout << xx + 1 << ' ' << yy + 1 << endl;
}
cout << std::flush;
}
}