Submission #522310

#TimeUsernameProblemLanguageResultExecution timeMemory
522310LucaIlieRed-blue table (IZhO19_stones)C++17
27 / 100
25 ms1228 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...