zoukankan      html  css  js  c++  java
  • HDU1048The Hardest Problem Ever

    The Hardest Problem Ever
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
     

    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. 
     

    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: 

    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". 
     

    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
    题意很简单,就是把上面的字母翻译成下面的字母
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main() {
     4     char s[101],s1[101],s2[101];
     5     while(gets(s1)&&strcmp(s1,"START")==0) {
     6         gets(s);
     7         int len=strlen(s);
     8         for(int i=0; i<len; i++) {
     9             if(isupper(s[i]))
    10                 s[i]=(s[i]-'A'+21)%26+'A';
    11         }
    12         while(gets(s2)&&strcmp(s2,"END")==0) {
    13             puts(s);
    14             break;
    15         }
    16     }
    17     return 0;
    18 }
  • 相关阅读:
    Django中的文件操作
    【二】、如何进行网络通信
    【一】、什么是数据结构
    Java匹马行天下之一顿操作猛如虎,框架作用知多少?
    Java匹马行天下之致Java程序员的一封信
    在校大四学长赚人生第一个十万——越努力越幸运
    我们一起学Python之——认识Python"规则"
    Pycharm新手使用教程(详解)
    匹马行天下之思维决定高度篇——“大学再努力,培训机构做兄弟”姊妹篇
    cmd命令详解
  • 原文地址:https://www.cnblogs.com/zhien-aa/p/5694322.html
Copyright © 2011-2022 走看看