POJ - 2041Unreliable Message

这里的算法非常简单，就是“模拟”，注意编写每个传令官的算法时先分开测试，放在一起就会混淆。

POJ - 2041Unreliable Message

Time Limit: 1000MS Memory Limit: 30000KB 64bit IO Format: %I64d & %I64u

Description

The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas. One day he said, "You shall make use of a message relaying game when you inform me of something." In response to the King's statement, six servants were selected as messengers whose names were Mr. J, Miss C, Mr. E, Mr. A, Dr. P, and Mr. M. They had to relay a message to the next messenger until the message got to the King. Messages addressed to the King consist of digits ('0'-'9') and alphabet characters ('a'-'z', 'A'-'Z'). Capital and small letters are distinguished in messages. For example, "ke3E9Aa" is a message. Contrary to King's expectations, he always received wrong messages, because each messenger changed messages a bit before passing them to the next messenger. Since it irritated the King, he told you who are the Minister of the Science and Technology Agency of the Kingdom, "We don't want such a wrong message any more. You shall develop software to correct it!" In response to the King's new statement, you analyzed the messengers' mistakes with all technologies in the Kingdom, and acquired the following features of mistakes of each messenger. A surprising point was that each messenger made the same mistake whenever relaying a message. The following facts were observed. Mr. J rotates all characters of the message to the left by one. For example, he transforms "aB23d" to "B23da". Miss C rotates all characters of the message to the right by one. For example, she transforms "aB23d" to "daB23". Mr. E swaps the left half of the message with the right half. If the message has an odd number of characters, the middle one does not move. For example, he transforms "e3ac" to "ace3", and "aB23d" to "3d2aB". Mr. A reverses the message. For example, he transforms "aB23d" to "d32Ba". Dr. P increments by one all the digits in the message. If a digit is '9', it becomes '0'. The alphabet characters do not change. For example, he transforms "aB23d" to "aB34d", and "e9ac" to "e0ac". Mr. M decrements by one all the digits in the message. If a digit is '0', it becomes '9'. The alphabet characters do not change. For example, he transforms "aB23d" to "aB12d", and "e0ac" to "e9ac". The software you must develop is to infer the original message from the final message, given the order of the messengers. For example, if the order of the messengers is A->J->M->P and the message given to the King is "aB23d", what is the original message? According to the features of the messengers' mistakes, the sequence leading to the final message is "32Bad"->"daB23"->"aB23d"->"aB12d"->"aB23d": As a result, the original message should be "32Bad".

Input

The input format is as follows. n The order of messengers The message given to the King ... The order of messengers The message given to the King The first line of the input contains a positive integer n, which denotes the number of data sets. Each data set is a pair of the order of messengers and the message given to the King. The number of messengers relaying a message is between 1 and 6 inclusive. The same person may not appear more than once in the order of messengers. The length of a message is between 1 and 25 inclusive.

Output

The inferred messages are printed each on a separate line.

Sample Input

5

AJMP

aB23d

E

86AE

AM

6

JPEM

WaEaETC302Q

CP

rTurnAGundam1isdefferentf

Sample Output

32Bad

AE86

7

EC302QTWaEa

TurnAGundam0isdefferent

Source Japan 2003,Aizu

 #include<stdio.h>
 #include<string.h>
 #include<math.h>
 #include<stdlib.h>

 int main()
 {
     int n = ;
     scanf("%d", &n);
     char str[], order[];
     for(int i = ; i < n; i++) {
         scanf("%s", str);
         scanf("%s", order);
         int r = strlen(str);
         int len = strlen(order);
         char ch;
         int t;
         for(int i = r-; i >= ; i--) {
             switch(str[i]){
                 printf("str -- %c\n", str[i]);
                 case 'J':
                     ch = order[len-];
                     for(int j = len-; j > ; j--) {
                         order[j] = order[j-];
                     }
                     order[] = ch;
                     break;
                 case 'C':
                     ch = order[];
                     for(int j = ; j < len-; j++) {
                         order[j] = order[j+];
                     }
                     order[len-] = ch;
                     break;
                 case 'E':
                     t = len/;
                     for(int i = ; i < t; i++) {
                         ch = order[i];
                         if(len%) {
                             order[i] = order[i+t+];
                             order[i+t+] = ch;
                         }
                         else {
                             order[i] = order[i+t];
                             order[i+t] = ch;
                         }
                     }
                     break;
                 case 'A':
                     t = len/;
                     for(int i = ; i < t; i++) {
                         ch = order[i];
                         order[i] = order[len--i];
                         order[len--i] = ch;
                     }
                     break;
                 case 'P':
                     for(int i = ; i < len; i++) {
                         if(order[i] >= '' && order[i] <= '') {
                             if(order[i] == '') order[i] = '';
                             else order[i]--;
                         }
                     }
                     break;
                 case 'M':
                     for(int i = ; i < len; i++) {
                         if(order[i] >= '' && order[i] <= '') {
                             if(order[i] == '') order[i] = '';
                             else order[i]++;
                         }
                     }
                     break;
             }
         }
         printf("%s\n", order);
     }
     return ;
 }