#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(){
int n, m;
cin >> n >> m;
if(n>m){
cout << n+floor((m-1)/2) << "\n";
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(j>m/2){
cout << "-";
}
else{
cout << "+";
}
}
cout << "\n";
}
}
else if(n<m){
cout << m+floor((n-1)/2) << "\n";
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(i>n/2){
cout << "+";
}
else{
cout << "-";
}
}
cout << "\n";
}
}
else{
cout << n+floor((m-1)/2) << "\n";
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(j>m/2){
cout << "-";
}
else{
cout << "+";
}
}
cout << "\n";
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Incorrect |
2 ms |
332 KB |
Wrong answer in test 5 29: 31 < 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
1280 KB |
Wrong answer in test 97 21: 107 < 116 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
1220 KB |
Wrong answer in test 24 24: 35 < 44 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Incorrect |
2 ms |
332 KB |
Wrong answer in test 5 29: 31 < 32 |