제출 #201866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201866		guangxuan	Red-blue table (IZhO19_stones)	C++14	27 / 100	40 ms	1436 KiB

stones

#include <bits/stdc++.h>

using namespace std;

int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n,m;
		scanf("%d%d",&n,&m);
		int ans1 = n + (m-1)/2, ans2 = m + (n-1)/2;
		printf("%d\n",max(ans1,ans2));
		if(ans1>ans2){
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					if(j<(m-1)/2)printf("-");
					else printf("+");
				}
				puts("");
			}
		}
		else{
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					if(i<(n-1)/2)printf("+");
					else printf("-");
				}
				puts("");
			}
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'int main()':
stones.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&T);
  ~~~~~^~~~~~~~~
stones.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
   ~~~~~^~~~~~~~~~~~~~

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