【題解】TIOJ 1229 . 密碼問題

#include <iostream>
using namespace std;

int l, n, m, a[105], b[105], ans[105];
string s;

int main() {
    cin >> l >> n >> m;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++){
        b[i] = i;
    }
    for (int i = 0; i < m; i++){
        for (int j = 1; j <= n; j++){
            b[j] = a[b[j]];
        }
    }
    for (int i = 1; i <= n; i++){
        ans[b[i]] = i-1;
    }
    while (l--){
        cin >> s;
        for (int i = 1; i <= n; i++){
            cout << s[ans[i]];
        }
        cout << "\n";
    }
}