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 <iostream>
using namespace std;
int main() {
int t, n, m, l, c;
cin >> t;
while ( t-- ) {
cin >> n >> m;
cout << max( n, m ) + (min( n, m ) - 1) / 2 << "\n";
for ( l = 0; l < n; l++ ) {
for ( c = 0; c < m; c++ ) {
if ( n > m ) {
if ( c <= m / 2 )
printf( "+" );
else
printf( "-" );
} else {
if ( l <= n / 2 )
printf( "-" );
else
printf( "+" );
}
}
printf( "\n" );
}
}
return 0;
}
# | 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... |