제출 #856728

#제출 시각아이디문제언어결과실행 시간메모리
856728Halym2007Red-blue table (IZhO19_stones)C++11
0 / 100
42 ms1516 KiB
#include <bits/stdc++.h> using namespace std; int a,b,c,d,t; int main(){ cin>>t; while(t--){ cin>>a>>b; if(a < 3 or b < 3) cout<<max(a, b)<<endl << "*" << endl; if(a >= 3 and b >= 3){ if(a == b) cout<<a + b - 2; else{ if(max(a, b) % min(a, b) == 0) cout<<max(a, b) - (max(a, b) - min(a, b)); else cout<<max(a, b) - (max(a, b) - min(a, b)) + 1; } cout<<endl; for(int i=1; i <= (a / 2); i++){ for(int j=1; j <= b; j++){ if(j <= ((b / 2) + 1)) cout<<"+"; else cout<<"-"; } cout<<endl; } for(int i=1; i <= 1; i++){ for(int j=1; j <= b; j++){ if(j == ((b / 2) + 1)) cout<<"+"; else cout<<"-"; } } cout<<endl; for(int i=1; i <= (a / 2); i++){ for(int j=1; j <= b; j++){ if(j >= ((b / 2) + 1)) cout<<"+"; else cout<<"-"; } cout<<endl; } } } }
#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...