Submission #498882

#TimeUsernameProblemLanguageResultExecution timeMemory
498882yahyobekabdunazarovRed-blue table (IZhO19_stones)C++17
0 / 100
22 ms1328 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; void solve(){ int n, m; cin >> n >> m; cout << max(n, m) << endl; if(n<m){ for(int i=0; i<n; i++){ for(int j=0; j<m; j++){ cout << "-"; } cout << "\n"; } } else if(n>m){ for(int i=0; i<n; i++){ for(int j=0; j<m; j++){ cout << "+"; } cout << "\n"; } } } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while(t--){ solve(); } 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...