POJ 1026 Cipher 置换群

进过多次加密，解密过程。即多个纶换。字符串不足的部分用空格补齐。

#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 200 + 10
#define INF 2100000000
#define ll long long
int a[maxn], vis[maxn];
char s[maxn], ans[maxn];
int n, k;
void solve()
{
    memset(vis, 0, sizeof(vis));
    for(int i = 0; i < n; ++i)
    {
        int x = a[i];
        vis[i] = 1;
        while(x != i)
        {
            vis[i]++;
            x = a[x];
        }
    }
    for(int i = 0; i < n; ++i)
    {
        int t = k%vis[i];
        int x = i;
        while(t--) x = a[x];
        ans[i] = s[x];
    }
}
void printans()
{
    for(int i = 0; i < n; ++i)
        printf("%c", ans[i]);
    puts("");
}
int main()
{
    while(scanf("%d", &n) && n)
    {
        int num;
        for(int i = 0; i < n; ++i)
        {
            scanf("%d", &num);
            a[num-1] = i;
        }
        while(scanf("%d", &k) && k)
        {
            getchar();
            gets(s);
            for(int i = strlen(s); i < n; ++i)
                s[i] = ' ';
            s[n] = '\0';
            solve();
            printans();
        }
        puts("");
    }
    return 0;
}