Submission #1100744

#TimeUsernameProblemLanguageResultExecution timeMemory
1100744Kirill22Costinland (info1cup19_costinland)C++17
0 / 100
1 ms592 KiB
#include "bits/stdc++.h" using namespace std; void solve() { long long k; cin >> k; int n = 500; vector<string> a(n, string(n, '.')); int x = 0, y = 0; while (1) { if (k <= 1) { // x, y for (int i = 0; i <= y; i++) { a[x + 1][i] = 'r'; } for (int i = 0; i <= x; i++) { a[i][y + 1] = 'd'; } break; } if (k < 6) { a[x][y] = 'X'; k--; if (x < y) { x++; } else { y++; } continue; } if (k % 6 == 0) { a[x][y] = a[x + 1][y] = a[x + 1][y + 1] = a[x][y + 1] = 'X'; a[x + 2][y] = a[x + 2][y + 1] = 'r'; a[x][y + 1] = a[x][y + 2] = 'd'; x += 2, y += 2; k /= 6; continue; } a[x][y] = 'X'; k--; if (x < y) { x++; } else { y++; } } int N = 0, M = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i][j] != '.') { N = max(N, i + 1); M = max(M, j + 1); } } } cout << N << " " << M << '\n'; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { cout << a[i][j]; } cout << '\n'; } }; /* XX XX */ int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; // cin >> t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...