poj 2141
来源:互联网 发布:icloud备份微信数据 编辑:程序博客网 时间:2024/05/20 22:39
Message Decowding
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10878 Accepted: 6016
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
eydbkmiqugjxlvtzpnwohracsfKifq oua zarxa suar bti yaagrj fa xtfgrj
Sample Output
Jump the fence when you seeing me coming
Source
USACO 2003 March Orange
#include<iostream> #include<ctype.h> #include<cstdio> using namespace std; int main(){ char S[26]; char C[100]={'0'}; for(int i= 0; i<=25; i++){ cin>>S[i]; } int j=0; while(scanf("%c",&C[j])!=EOF){ if(C[j]==32){ cout<<' '; } else if((C[j]>='A')&&(C[j]<='Z')){ char index=tolower(C[j]); int x=index - 'a'; index = toupper(S[x]); cout<<index; } else if((C[j]>='a')&&(C[j]<='z')){ int x; x=C[j] - 'a'; cout<<S[x]; } j++; }
- POJ 2141
- poj 2141
- poj 2141
- POJ-2141
- 【POJ解题】:POJ 2141解题报告
- poj 2141 Message Decowding
- POJ 2141密码
- poj 2141 Message Decowding
- POJ 2141Message Decowding
- POJ 2141 Message Decowding
- POJ 2141 模拟
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- Ubuntu下安装Nginx
- 仿苹果的产品展示菜单(横向滚动)
- GCC编译器
- C# System.Diagnostics.Process发送邮件&修改内存中值&发送表格格式内容邮件
- Ubuntu 用户安装漂亮易操作 Cinnamon
- poj 2141
- 传递动态内存
- Swt/Jface treeViewer的使用
- jmeter- 函数测试模式
- 结构体的内存对齐问题与位域
- CSS入门系列:第一部分 基础知识
- sql server 当月第一天和最后一天的SQL
- 【转】一位ACMer过来人的心得
- 最简单的全球基站定位接口API