POJ 1026:Cipher

/** 
思路：简单置换群，每一个数均有一个置换循环，求出循环大小 
对于每一组循环，真正循环次数=总置换次数%循环数 
**/  
#include<stdio.h>  
#include<string.h>  
  
int calc(int i,int n,int num[]){//check:ok  
    int count=1,a,j;  
    a=num[i-1];  
    j=num[a-1];  
    while(i!=a){      
        count++;  
        i=num[j-1];  
        j=i;      
    }  
    return count;  
}  
  
int main(){  
    int n,k,num[200],final_pos[200],time[200];  
    char msg[201],final_msg[201];  
lab:while(scanf("%d",&n)){  
        if(n==0)break;  
        for(int i=0;i<n;i++){  
            scanf("%d",&num[i]);  
        }  
        for(int i=0;i<n;i++)time[i]=calc(i+1,n,num);  
        while(scanf("%d",&k)){  
            if(k==0){  
                printf("\n");  
                goto lab;  
            }  
            char space;  
            scanf("%c",&space);  
            int flag=0;  
            for(int i=0;i<n;i++){  
                if(flag==0)scanf("%c",&msg[i]);  
                if(msg[i]=='\n'||msg[i]=='\r'){  
                    flag=1;  
                    msg[i]='';  
                }else if(flag==1)msg[i]='';  
            }  
            msg[n]='\0';  
            for(int i=0;i<n;i++){  
                int j=i,real_count;  
                real_count=k%time[i];  
                if(real_count==0)final_pos[i]=i+1;  
                else{  
                    for(int m=0;m<real_count;m++){  
                        final_pos[i]=num[j];  
                        j=num[j]-1;  
                    }  
                }           }  
            for(int i=1;i<=n;i++){  
                for(int j=0;j<n;j++){  
                    if(final_pos[j]==i)final_msg[i-1]=msg[j];  
                }  
            }  
            final_msg[n]='\0';  
            puts(final_msg);  
        }  
    }  
    return 0;  
}