Submission #918549

#TimeUsernameProblemLanguageResultExecution timeMemory
918549AnarTzRed-blue table (IZhO19_stones)C++14
0 / 100
3 ms1628 KiB
#include <iostream> #include <vector> #include <math.h> #include <algorithm> using namespace std; int main(){ int n,m,i,j,c,b; cin >> n >> m; bool row=true; string table[n][m]; if (n<m) { for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { table[i][j] = '-'; } } }else{ for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { table[i][j] = '+'; } } } if (m>n) { c=n-(n/2+1); b=m+c; row=true; }else{ c=m-(m/2+1); b=n+c; row=false; } if(row==true){ for (i = 0; i < c; i++) { for (j = 0; j < m; j++) { table[i][j]='+'; } } } else{ for (i = 0; i < n; i++) { for (j = 0; j < c; j++) { table[i][j]='-'; } } } cout << b<<endl; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { cout << table[i][j]; } cout << endl; } 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...