POJ 1107:W's Cipher(模拟)

#include"cstdio"
#include"iostream"
#include"cstring"
using namespace std;
int main()
{   int k1,k2,k3;
    while(scanf("%d%d%d",&k1,&k2,&k3)&&(k1||k2||k3))
    {   char arr[100],ans[120];
        cin>>arr;
        int num[3][120];
        int len=strlen(arr),len1=0,len2=0,len3=0;
        for(int i=0;i<len;i++)
        {   if(arr[i]<=‘i‘&&arr[i]>=‘a‘) num[0][len1++]=i;
            else if(arr[i]<=‘r‘&&arr[i]>=‘j‘) num[1][len2++]=i;
            else if(arr[i]<=‘z‘&&arr[i]>=‘s‘||arr[i]==‘_‘)num[2][len3++]=i;
        }
        for(int i=0;i<len1;i++)
        {   int key=i-k1;
            while(key<0) key+=len1;
            ans[num[0][i]]=arr[num[0][key]];
        }
        for(int i=0;i<len2;i++)
        {   int key=i-k2;
            while(key<0) key+=len2;
            ans[num[1][i]]=arr[num[1][key]];
        }
        for(int i=0;i<len3;i++)
        {   int key=i-k3;
            while(key<0) key+=len3;
            ans[num[2][i]]=arr[num[2][key]];
        }
        ans[len]=‘\0‘;
        cout<<ans<<endl;
    }
    return 0;
}