#include <bits/stdc++.h>
#define pb push_back
#define LL long long
#define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const LL Mxn = 1e6 + 7;
const LL Mod = 1e9 + 7;
const LL Inf = 1e14 + 7;
int main() {
Kultivator;
int tt;
cin >> tt;
while(tt--){
int N, M;
cin >> N >> M;
if(N == 2 && M == 2){
cout << 2 << '\n';
cout << "++" << '\n' << "++";
continue;
}
if(min(N, M) == 1){
cout << max(N, M) << '\n';
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
if(N == 1){
cout << '+';
} else {
cout << '-';
}
}
cout << '\n';
}
continue;
}
cout << max(N, M) + 1 << '\n';
if(N <= M){
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
if(i == N){
cout << '-';
} else {
cout << '+';
}
}
cout << '\n';
}
} else {
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
if(i == N){
cout << '+';
} else {
cout << '-';
}
}
cout << '\n';
}
}
cout << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
364 KB |
in the table A+B is not equal to 46 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
1388 KB |
in the table A+B is not equal to 98 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
32 ms |
1388 KB |
in the table A+B is not equal to 25 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |