Message Decowding
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9852 | Accepted: 5407 |
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:
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.
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
* 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
给26个字母,分别对应了'a'、'b'...'z'。然后给你密钥,让你还原成原文。
字符串读入密钥,然后边读入边输出。
注意点:
1)如果是大写字母要以相应的大写字母输出
2)非英文字母不做更改,直接输出。
代码(1AC):
#include <cstdio>
#include <cstdlib>
#include <cstring>
char keys[30];
int main(void){
int i, j;
char tmp;
while (scanf("%s", keys) != EOF){
getchar();
while ((tmp = getchar()) != '\n'){
if (tmp >= 'a' && tmp <= 'z'){
putchar(keys[tmp - 'a']);
}
else if (tmp >= 'A' && tmp <= 'Z'){
putchar((keys[tmp - 'A'] - 32));
}
else{
putchar(tmp);
}
}
putchar(tmp);
}
return 0;
}