Submission #498586

#	Time	Username	Problem	Language	Result	Execution time	Memory
498586		The_Samurai	Red-blue table (IZhO19_stones)	C++98	0 / 100	56 ms	1608 KiB

stones

#include <bits/stdc++.h>
 
using namespace std;

/*

6 6
++++--
++++--
------
------
--++++
--++++
8 8
+++++---
+++++---
+++++---
--------
--------
---+++++
---+++++
---+++++
7 7
++++---
++++---
++++---
---+---
---++++
---++++
---++++


*/

void solve() {
	int n, m;
	
	cin >> n >> m;
	if (n == 1) {
		cout << "1\n+\n";
		return;
	}
	if (n == 2) {
		cout << "2\n++\n++\n";
		return;
	}
	if (n % 2 == 1) {
		cout << 2 * n - 2;
	}
	else {
		cout << 2 * n - 4;
	}
	cout << '\n';
	for (int i = 0; i < (n - 1) / 2; i++) {
		for (int j = 0; j < n / 2 + 1; j++) {
			cout << '+';
		}
		for (int j = n / 2 + 1; j < n; j++) {
			cout << '-';
		}
		cout << '\n';
	}
	for (int i = 0; i < 2 - n % 2; i++) {
		for (int j = 0; j < n; j++) {
			cout << '-';
		}
		cout << '\n';
	}
	for (int i = 0; i < (n - 1) / 2; i++) {
		for (int j = 0; j < (n - 1) / 2; j++) {
			cout << '-';
		}
		for (int j = (n - 1) / 2; j < n; j++) {
			cout << '+';
		}
		cout << '\n';
	}
}
 
int main() {
	int t;
	
	cin >> t;
	while (t--) {
		solve();
	}
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31