Submission #1171668

#TimeUsernameProblemLanguageResultExecution timeMemory
1171668coolboy19521Red-blue table (IZhO19_stones)C++20
0 / 100
35 ms1352 KiB
#include "bits/stdc++.h" #define mxN 1003 using namespace std; char gr[mxN][mxN]; int main(){ int T; cin >> T; while (T --){ int N, M; cin >> N >> M; for (int i = 1; i <= N; i ++) for (int j = 1; j <= M; j ++) gr[i][j] = "-+"[N >= M]; if (N >= M){ for (int i = 1; i <= N / 2 + 1; i ++) for (int j = 1; j <= M / 2; j ++) gr[i][j] = '-'; cout << N + M / 2 << endl; } else { for (int i = 1; i <= N / 2; i ++) for (int j = 1; j <= M / 2 + 1; j ++) gr[i][j] = '1'; cout << M + N / 2 << endl; } for (int i = 1; i <= N; i ++){ for (int j = 1; j <= M; j ++) cout << gr[i][j]; 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...