OpenJudge / Poj 2141 Message Decowding

1.链接地址：

http://poj.org/problem?id=2141

http://bailian.openjudge.cn/practice/2141/

2.题目：

Message Decowding

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11784		Accepted: 6562

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

Source

USACO 2003 March Orange

3.思路：

4.代码：

#include<iostream>
#include<cstring>
#include <cstdio>

using namespace std;
char c[26];
int main()
{
    int i;
    char a[81];
    int size;
    for(i=0;i<26;i++) cin>>c[i];
    getchar();
    gets(a);
    size=strlen(a);
    for(i=0;i<size;i++)
    {
       if(a[i]==' ') cout<<a[i];
       else if(a[i]>='A'&&a[i]<='Z') cout<<(char)(c[a[i]-'A']-'a'+'A');
       else cout<<(c[a[i]-'a']);
    }    
    cout<<endl;
    //system("pause");
    return 0;
}