#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
void solve() {
int n,m;
cin>>n>>m;
int op1 = n+(m-(m+1)/2);
int op2 = (n-(n+1)/2)+m;
if (op1>op2) {
cout<<op1<<"\n";
string s;
while (int(s.length()+s.length()) <= m) {
s += '+';
}
while ((int)s.length()<m) s += '-';
for (int i=0; i<n; i++) {
cout<<s<<"\n";
}
} else {
cout<<op2<<"\n";
int rows = 0;
for (int i=0; i<n; i++) {
if (rows+rows>n) {
cout<<string(m,'-')<<"\n";
} else {
cout<<string(m,'+')<<"\n";
rows++;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
cin>>t;
while (t--) solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
in the table A+B is not equal to 46 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
1388 KB |
Wrong answer in test 97 21: 107 < 116 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
1388 KB |
in the table A+B is not equal to 36 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
in the table A+B is not equal to 3 |
2 |
Halted |
0 ms |
0 KB |
- |