제출 #868317

#제출 시각아이디문제언어결과실행 시간메모리
868317The_SamuraiRed-blue table (IZhO19_stones)C++17
0 / 100
17 ms1380 KiB
// I stand with PALESTINE //#pragma GCC optimize("Ofast,O3") //#pragma GCC target("avx,avx2") #include "bits/stdc++.h" using namespace std; using ll = long long; void solve() { int n, m; cin >> n >> m; assert(n == m); vector a(n, vector(m, '+')); int ans = n + (n - 1) / 2; for (int j = 0; j < (n - 1) / 2; j++) { for (int i = 0; i < n - (n - 1) / 2; i++) { a[i][j] = '-'; } } cout << ans << '\n'; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) cout << a[i][j]; cout << '\n'; } } int main() { cin.tie(0)->sync_with_stdio(false); #ifdef sunnatov freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int q = 1; cin >> q; while (q--) { solve(); //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...