제출 #488647

#제출 시각아이디문제언어결과실행 시간메모리
488647Mihai7218Red-blue table (IZhO19_stones)C++14
27 / 100
31 ms1220 KiB
#include <iostream>
using namespace std;
int t, n, m, mop;
int main()
{
    cin >> t;
    for (int tc = 1; tc <= t; tc++)
    {
        cin >> n >> m;
        if (n > m)
        {
            cout << n + (m/2)-1+(m%2) << '\n';
            mop = (m/2)-1+(m%2);
            for (int i = 1; i <= n; i++)
            {
                for (int j = 1; j <= m; j++)
                {
                    if (mop-j >= 0)
                    {
                        cout << '-';
                    }
                    else cout << '+';
                }
                cout << '\n';
            }
        }
        else
        {
            cout << m + (n/2)-1+(n%2) << '\n';
            mop = (n/2)-1+(n%2);
            for (int i = 1; i <= n; i++)
            {
                for (int j = 1; j <= m; j++)
                {
                    if (mop-i >= 0)
                    {
                        cout << '+';
                    }
                    else cout << '-';
                }
                cout << '\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...