poj 1107解题报告

 //题意：将给定的已加密的字符串分为三组，每组按照给定的key值进行右移k个字符，得到解密后的字符串

#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;

int k1,k2,k3;    //三组对应的key值
char str[85];   //待解密的字符串
char firstGroup[85];   //记录第一组的字符
char secondGroup[85];   //记录第二组的字符
char thirdGroup[85];       //记录第三组的字符
int firstlen,secondlen,thirdlen;    //分别对应每组字符串的长度

void solve()
{
 int i;
 int len = strlen(str);
 firstlen = 0;
 secondlen = 0;
 thirdlen = 0;
 for(i = 0;i < len;i++)
 {
  if(str[i] >= 'a' && str[i] <= 'i')
  {
   firstGroup[firstlen++] = str[i];
  }
  else if(str[i] >= 'j' && str[i] <= 'r')
  {
   secondGroup[secondlen++] = str[i];
  }
  else
   thirdGroup[thirdlen++] = str[i];
 }

//    以下三个判断是防止除零时出现中断，我就是因为这里贡献了一次RE，大家注意了啊
 if(firstlen)
 {
  k1 = k1%firstlen;
  k1 = (firstlen - k1)%firstlen;
 }
 if(secondlen)
 {
  k2 = k2%secondlen;
  k2 = (secondlen - k2)%secondlen;
 }

 if(thirdlen)
 {
  k3 = k3%thirdlen;
  k3 = (thirdlen - k3)%thirdlen;
 }
 for(i = 0;i < len;i++)
 {
  if(str[i] >= 'a' && str[i] <= 'i')
  {
   cout<<firstGroup[k1];
   k1 = (k1 + 1)%firstlen;
  }
  else if(str[i] >= 'j' && str[i] <= 'r')
  {
   cout<<secondGroup[k2];
   k2 = (k2 + 1)%secondlen;
  }
  else
  {
   cout<<thirdGroup[k3];
   k3 = (k3 + 1)%thirdlen;
  }
 }
 cout<<endl;
}
int main()
{
 while(cin>>k1>>k2>>k3)
 {
  if(!k1 && !k2 && !k3)
   break;
  cin>>str;
  solve();
 }
}