HDU2716：Message Decowding

Problem Description

The cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plot meetings with cows on other farms.

Cows are not known for their intelligence. Their encryption method is nothing like DES or BlowFish or any of those really good secret coding methods. No, they are using a simple substitution cipher.

The cows have a decryption key and a secret message. Help them decode it. The key looks like this:

yrwhsoujgcxqbativndfezmlpk


Which means that an 'a' in the secret message really means 'y'; a 'b' in the secret message really means 'r'; a 'c' decrypts to 'w'; and so on. Blanks are not encrypted; they are simply kept in place.

Input text is in upper or lower case, both decrypt using the same decryption key, keeping the appropriate case, of course.

 

Input

* Line 1: 26 lower case characters representing the decryption key

* Line 2: As many as 80 characters that are the message to be decoded

 

Output

* Line 1: A single line that is the decoded message. It should have the same length as the second line of input.

 

Sample Input

   
   
   
   

    
    
    
    eydbkmiqugjxlvtzpnwohracsf
Kifq oua zarxa suar bti yaagrj fa xtfgrj
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    Jump the fence when you seeing me coming
   
   
   
   

 

 

 

//水哈希

 

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

char hash[30];

int main()
{
    int i;
    char c;
    char str[10000];
    while(~scanf("%c",&c))
    {
        if(c>='A' && c<='Z')
            c = c+32;
        hash[1] = c;
        for(i = 2; i<=26; i++)
        {
            scanf("%c",&c);
            if(c>='A' && c<='Z')
                c = c+32;
            hash[i] = c;
        }
        getchar();
        gets(str);
        int len = strlen(str);
        for(i = 0; i<len; i++)
        {
            if(str[i]>='A' && str[i]<='Z')
                str[i] = hash[str[i]-'A'+1] - 32;
            else if(str[i] == ' ')
                continue;
            else
                str[i] = hash[str[i]-'a'+1];
        }
        for(i = 0; i<len; i++)
        {
            printf("%c",str[i]);
        }
        printf("\n");
    }

    return 0;
}