This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author: lani1akea
* created: 06.10.2020 16:32:12
**/
#include<bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n, m;
cin >> n >> m;
vector<vector<char>> g(n + 1, vector<char> (m + 1));
if (n == m) {
int t = (n + 1) / 2 + (n % 2 == 0);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (j <= t) g[i][j] = '+';
else g[i][j] = '-';
}
}
cout << n + n - t << '\n';
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cout << g[i][j];
}
cout << '\n';
}
} else if (n > m) {
} else {
}
}
}
# | 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... |