2013
11-28

# The Hardest Problem Ever

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.

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:

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"

Following the final data set will be a single line, "ENDOFINPUT".

For each data set, there will be exactly one line of output. This is the original message by Caesar.

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

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 <algorithm>
#include <map>
using namespace std;
struct strCmp
{
bool operator()(const char s1 ,const char s2) const
{
return s1 < s2;
}
};

int main()
{
//   freopen("in.txt","r",stdin);
string start;
string end;
string mess;
map< char , char> rule;
rule['A'] = 'V';
rule['B'] = 'W';
rule['C'] = 'X';
rule['D'] = 'Y';
rule['E'] = 'Z';
rule['F'] = 'A';
rule['G'] = 'B';
rule['H'] = 'C';
rule['I'] = 'D';
rule['J'] = 'E';
rule['K'] = 'F';
rule['L'] = 'G';
rule['M'] = 'H';
rule['N'] = 'I';
rule['O'] = 'J';
rule['P'] = 'K';
rule['Q'] = 'L';
rule['R'] = 'M';
rule['S'] = 'N';
rule['T'] = 'O';
rule['U'] = 'P';
rule['V'] = 'Q';
rule['W'] = 'R';
rule['X'] = 'S';
rule['Y'] = 'T';
rule['Z'] = 'U';
while(cin >> start)
{
if(start == "ENDOFINPUT" )
break;
while(1)
{
getline(cin,mess);
if(mess.length() != 0)
break;
}

for(int i=0 ;i<mess.length() ;i++)
if(mess[i] >= 'A' && mess[i] <= 'Z')
cout << rule[mess[i]];
else
cout << mess[i];
cout << endl;
cin >> end;

}
}

1. #include <cstdio>
#include <cstring>

const int MAXSIZE=256;
//char store[MAXSIZE];
char str1[MAXSIZE];
/*
void init(char *store) {
int i;
store['A']=’V', store['B']=’W',store['C']=’X',store['D']=’Y',store['E']=’Z';
for(i=’F';i<=’Z';++i) store =i-5;
}
*/
int main() {
//freopen("input.txt","r",stdin);
//init(store);
char *p;
while(fgets(str1,MAXSIZE,stdin) && strcmp(str1,"STARTn")==0) {
if(p=fgets(str1,MAXSIZE,stdin)) {
for(;*p;++p) {
//*p=store[*p]
if(*p<’A’ || *p>’Z') continue;
if(*p>’E') *p=*p-5;
else *p=*p+21;
}
printf("%s",str1);
}
fgets(str1,MAXSIZE,stdin);
}
return 0;
}

2. 不考虑最后将结果排序的话，快排的时间复杂度是O(N) ，而堆排的是O(N*logK),这样比较看，快排快