제출 #1171667

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171667		coolboy19521	Red-blue table (IZhO19_stones)	C++20	0 / 100	35 ms	1352 KiB

stones

#include "bits/stdc++.h"

#define mxN 1003

using namespace std;

char gr[mxN][mxN];

int main(){
	int T;
	cin >> T;
	
	while (T --){
		int N, M;
		cin >> N >> M;
		
		for (int i = 1; i <= N; i ++)
		for (int j = 1; j <= M; j ++)
			gr[i][j] = "-+"[N >= M];

		if (N >= M){
			for (int i = 1; i <= N / 2 + 1; i ++)
			for (int j = 1; j < (M + 1) / 2; j ++)
				gr[i][j] = '-';
			cout << N + M / 2 << endl;
		} else {
			for (int i = 1; i < (N + 1) / 2; i ++)
			for (int j = 1; j <= M / 2 + 1; j ++)
				gr[i][j] = '1';
			cout << M + N / 2 << endl;
		}
		
		for (int i = 1; i <= N; i ++){
			for (int j = 1; j <= M; j ++)
				cout << gr[i][j];
			cout << endl;
		}
	}
}

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