C - The Hardest Problem Ever
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了C - The Hardest Problem Ever相关的知识,希望对你有一定的参考价值。
Description
Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of the first ciphers. This cipher was so incredibly sound, that no one could figure it out without knowing how it worked.
You are a sub captain of Caesar‘s army. It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is ‘A‘, the cipher text would be ‘F‘). Since you are creating plain text out of Caesar‘s messages, you will do the opposite:
Cipher text A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Plain text V W X Y Z A B C D E F G H I J K L M N O P Q R S T U
Only letters are shifted in this cipher. Any non-alphabetical character should remain the same, and all alphabetical characters will be upper case.
You are a sub captain of Caesar‘s army. It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is ‘A‘, the cipher text would be ‘F‘). Since you are creating plain text out of Caesar‘s messages, you will do the opposite:
Cipher text A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Plain text V W X Y Z A B C D E F G H I J K L M N O P Q R S T U
Only letters are shifted in this cipher. Any non-alphabetical character should remain the same, and all alphabetical characters will be upper case.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. All characters will be uppercase.
A single data set has 3 components:
A single data set has 3 components:
- Start line - A single line, "START"
- Cipher message - A single line containing from one to two hundred characters, inclusive, comprising a single message from Caesar
- End line - A single line, "END"
Output
For each data set, there will be exactly one line of output. This is the original message by Caesar.
Sample Input
START NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX END START N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ END START IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ END ENDOFINPUT
Sample Output
IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE
解码,左移五位
#include <iostream> #include <string.h> #include <string> using namespace std; int main() { string a,b; while(cin>>a){ if(a=="ENDOFINPUT")break; if(a=="START"){ string c; char s[205]; int p=0; while(cin>>c){ if(c=="END")break; int n; n=c.length(); for(int i=0;i<n;i++){ if(c[i]>=‘A‘&&c[i]<=‘Z‘){ if(c[i]-5<‘A‘)c[i]=c[i]-4+‘Z‘-‘A‘; else c[i]-=5; } s[p]=c[i]; p++; } s[p]=‘ ‘; p++; } for(int i=0;i<p-1;i++)cout<<s[i]; cout<<endl; } } //system("pause"); return 0; }
输入输出格式!
以上是关于C - The Hardest Problem Ever的主要内容,如果未能解决你的问题,请参考以下文章
(HDU)1048 --The Hardest Problem Ever( 最难的问题)
(字符串 枚举)The Hardest Problem Ever hdu1048
CF Gym 101955G Best ACMer Solves the Hardest Problem
G - Best ACMer Solves the Hardest Problem Gym - 101955G
java net.nyagosu.minecraftmodexample.example000-009.e001_hardest_block.BlockGlowBlock.java
java net.nyagosu.minecraftmodexample.example000-009.e001_hardest_block.BlockHardestBlock.java