zoukankan      html  css  js  c++  java
  • (周三赛)The Hardest Problem Ever

    //字符串的处理

    我可能比较会卡住的是没想到怎么处理START END ENDOFINPUT 其实直接一点就可以了

    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<stdio.h>
     2 
     3 #include<iostream>
     4 
     5 #include<string.h>
     6 
     7 using namespace std;
     8 
     9 int main()
    10 
    11 {
    12 
    13 char str[1000];
    14 
    15 while(gets(str))
    16 
    17 {
    18 
    19 if(strcmp(str,"ENDOFINPUT")==0)
    20 
    21           break;
    22 
    23     if(strcmp(str,"START")!=0&&strcmp(str,"END")!=0)
    24 
    25     {
    26 
    27 int l=strlen(str);
    28 
    29 for(int i=0;i<l;i++)
    30 
    31 {
    32 
    33 if(str[i]>='A'&&str[i]<='E')
    34 
    35 {
    36 
    37 str[i]+=21;
    38 
    39 printf("%c",str[i]);
    40 
    41 }
    42 
    43 else if(str[i]>='F'&str[i]<='Z')
    44 
    45 {
    46 
    47 str[i]+=-5;
    48 
    49 printf("%c",str[i]);
    50 
    51 }
    52 
    53 else
    54 
    55 printf("%c",str[i]);
    56 
    57 }
    58 
    59 printf("
    ");
    60 
    61 }
    62 
    63 }
    64 
    65 return 0;
    66 
    67 }
    View Code
  • 相关阅读:
    【redis】redis的 key的命名规则
    【redis】存入redis的值,如果为null是否默认不被存入
    【java】StringBuilder的三种清除方法对比
    【java】hash一致性算法的实现区别【标题暂定】
    【java】Java中十六进制转换 Integer.toHexString()到底做了什么?什么时候会用到它?为什么要用它?byte为什么要&0xff?为什么要和0xff做与运算?
    【java】TreeMap/HashMap的循环迭代中 keySet和entrySet和forEach方式 + map的几种迭代方式
    【java】Map、Set、List不同数据结构的各种不同循环迭代的效率对比,使用场景
    【java】安全加密MessageDigest的功能及用法【hash一致性算法】
    hbase分布式集群搭建
    hadoop分布式集群搭建
  • 原文地址:https://www.cnblogs.com/awsent/p/4266962.html
Copyright © 2011-2022 走看看