# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334058 | boykut | Red-blue table (IZhO19_stones) | C++14 | 35 ms | 1388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, m, flag = 0;
cin >> n >> m;
int a[n][m];
if (n > m) {
cout << n + m / 2 << '\n';
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (j & 1) cout << '-';
else cout << '+';
cout << '\n';
}
} else {
cout << m + n / 2 << '\n';
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (i & 1) cout << '+';
else cout << '-';
cout << '\n';
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |