Submission #167699

#TimeUsernameProblemLanguageResultExecution timeMemory
167699munhorgilRed-blue table (IZhO19_stones)C++14
27 / 100
93 ms1400 KiB
#include<bits/stdc++.h>

using namespace std;

int main()
{
	int t , i , j , m , n , ans;
	
	cin >> t;
	
	while(t > 0)
	{
		cin >> n >> m;
		
		ans = max(n , m) + (min(n , m) - 1) / 2;
		
		cout << ans << endl;
		
		if(n > m)
		{
			for(i = 0 ; i < n ; i++)
			{
				for(j = 0 ; j < m - ((m - 1) / 2) ; j++)
				{
					cout << '+';
				}
				for(j = 0 ; j < (m - 1) / 2 ; j++)
				{
					cout << '-';
				}
				cout << endl;
			}
		}
		else
		{
			for(i = 0 ; i < n - ((n - 1) / 2) ; i++)
			{
				for(j = 0 ; j < m ; j++)
				{
					cout << '-';
				}
				cout << endl;
			}
			for(i = 0 ; i < (n - 1) / 2 ; i++)
			{
				for(j = 0 ; j < m ; j++)
				{
					cout << '+';
				}
				cout << endl;
			}
		}
		
		t--;
	}
}
#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...