Submission #1191693

#TimeUsernameProblemLanguageResultExecution timeMemory
1191693PetrixRed-blue table (IZhO19_stones)C++20
0 / 100
47 ms2380 KiB
#include <iostream> using namespace std; char v[1001][1001]; void solve(){ int n,m,i,j,rasp,stg=0; cin>>n>>m; if(n<m){ swap(n,m); stg=1; } for(i=1;i<=n;i++){ for(j=1;j<=m;j++){ v[i][j]='+'; } } rasp=n; for(i=1;i<(m+1)/2;i++){ cout<<i<<" "; rasp++; for(j=1;j<=(n+1)/2;j++){ v[j][i]='-'; } } cout<<rasp<<"\n"; if(!stg){ for(i=1;i<=n;i++){ for(j=1;j<=m;j++){ cout<<v[i][j]<<" "; } cout<<"\n"; } }else{ for(j=1;j<=m;j++){ for(i=1;i<=n;i++){ if(v[i][j]=='+') cout<<"- "; else cout<<"+ "; } cout<<"\n"; } } } int main() { int t; cin>>t; while(t){ solve(); t--; } return 0; }
#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...