# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661096 | 2022-11-24T11:33:18 Z | Trisanu_Das | Tavan (COCI16_tavan) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n, m, k, x; string s; cin >> n >> m >> k >> x >> s; x--; string checks[m]; vector<int> anss; for (int i = 0; i < m; i++) { cin >> checks[i]; sort(checks[i].begin(), checks[i].end()); anss.push_back(x % k); x /= k; } reverse(anss.begin(), anss.end()); int cnt = 0; for (int i = 0; i < n; i++) if (s[i] == '#') s[i] = checks[cnt][d[cnt]], cnt++; cout << s << '\n'; }