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.代码:

 1 #include<iostream>
 2 #include<cstring>
 3 #include <cstdio>
 4
 5 using namespace std;
 6 char c[26];
 7 int main()
 8 {
 9     int i;
10     char a[81];
11     int size;
12     for(i=0;i<26;i++) cin>>c[i];
13     getchar();
14     gets(a);
15     size=strlen(a);
16     for(i=0;i<size;i++)
17     {
18        if(a[i]==‘ ‘) cout<<a[i];
19        else if(a[i]>=‘A‘&&a[i]<=‘Z‘) cout<<(char)(c[a[i]-‘A‘]-‘a‘+‘A‘);
20        else cout<<(c[a[i]-‘a‘]);
21     }
22     cout<<endl;
23     //system("pause");
24     return 0;
25 }

OpenJudge / Poj 2141 Message Decowding

时间: 2024-08-12 17:18:36

OpenJudge / Poj 2141 Message Decowding的相关文章

POJ 2141 Message Decowding(map)

Message Decowding Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11735   Accepted: 6536 Description The cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plo

POJ 2141 Message Decowding(简单题)

[题意简述]:这个题目描述非常简单,不再赘述. [分析]:直接把那个输入的字符,当做是key值数组的下标即可. //164K 16Ms #include<iostream> using namespace std; char Key[27]; char decoded [81]; int main() { gets(Key); gets(decoded); for(int i = 0;i<strlen(decoded);i++) { if(decoded[i]>='A'&&

hdu 2716 Message Decowding

Message Decowding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 999    Accepted Submission(s): 468 Problem Description The cows are thrilled because they've just learned about encrypting messa

POJ 2141

继续水 1 #include <iostream> 2 #include <cstdio> 3 #include <cstdlib> 4 #include <cstring> 5 using namespace std; 6 7 char f[30]; 8 char st[100]; 9 10 int main() 11 { 12 gets(f); 13 gets(st); 14 for (int i = 0; i < strlen(st); i++)

OpenJudge POJ C19C 贪心

https://cn.vjudge.net/contest/309482#problem/C #include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 400005; int a[MAXN][2]; int ans; int main() { int T; scanf("%d", &T); while (T--) { int n; scanf("%

POJ百道水题列表

以下是poj百道水题,新手可以考虑从这里刷起 搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight Moves1101 Gamblers1204 Additive equations 1221 Risk1230 Legendary Pokemon1249 Pushing Boxes 1364 Machine Schedule1368 BOAT1406 Jungle Roads1411 Annive

Poj 2159 / OpenJudge 2159 Ancient Cipher

1.链接地址: http://poj.org/problem?id=2159 http://bailian.openjudge.cn/practice/2159 2.题目: Ancient Cipher Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 28064   Accepted: 9195 Description Ancient Roman empire had a strong government system

Poj 2503 / OpenJudge 2503 Babelfish

1.Link: http://poj.org/problem?id=2503 http://bailian.openjudge.cn/practice/2503/ 2.Content: Babelfish Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 32783   Accepted: 14093 Description You have just moved from Waterloo to a big city. T

Poj OpenJudge 百练 Bailian 1008 Maya Calendar

1.Link: http://poj.org/problem?id=1008 http://bailian.openjudge.cn/practice/1008/ 2.content: Maya Calendar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 66971   Accepted: 20644 Description During his last sabbatical, professor M. A. Ya