Submission #308772

#TimeUsernameProblemLanguageResultExecution timeMemory
308772nikatamlianiRed-blue table (IZhO19_stones)C++14
0 / 100
43 ms1272 KiB
#include <bits/stdc++.h> using namespace std; int main() { int T = 1; cin >> T; while(T--) { int n, m, best_i = 0, best_j = 0; cin >> n >> m; for(int i = 0; i <= n; ++i) { for(int j = 0; j <= m; ++j) { int plus = i * (m / 2 + 1); int minus = j * (n / 2 + 1); if(plus + minus <= n * m) { if(i + j > best_i + best_j) { best_i = i; best_j = j; } } } } cout << best_i + best_j << '\n'; for(int i = 1; i <= n; ++i) { for(int j = 1; j <= m; ++j) { if(i <= best_i && j <= m / 2 + 1) { cout << '+'; } else { cout << '-'; } } cout << '\n'; } } }
#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...