Submission #153758

#TimeUsernameProblemLanguageResultExecution timeMemory
153758BabinSinkoTavan (COCI16_tavan)C++14
48 / 80
3 ms504 KiB
#include <cstdio> #include <cstdlib> #include <cmath> #include <iostream> #include <cctype> #include <ctime> #include <string.h> #include <algorithm> using namespace std; long long n, m, k, x, nm, a, l; string s, sc; char c[503][29]; int main(){ cin >> n >> m >> k >> x; cin >> s; for (int i = 0; i < m; i++){ cin >> sc; strcpy(c[i], sc.c_str()); sort(c[i], c[i] + k); } a = x; l = s.length(); for (int i = 0; i < l; i++){ if (s[i] == '#'){ s[i] = c[nm][(a % (k + 1)) - 1]; a = a / (k+1); nm = nm + 1; } } cout << s; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...