zoukankan      html  css  js  c++  java
  • HDU- 2265 Encoding The Diary

                            Encoding The Diary

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1289    Accepted Submission(s): 757


    Problem Description
    You know many girls likes writing diaries,of course they have some secrets don’t want others to know.So this time, they asked you to encoding the diary.
    The rule is :
    Give you a string. Such as “ARE YOU AC?”
    Firstly , delete all spaces in this string.
    You will get “AREYOUAC?”
    String AREYOUAC?
    Index 123456789
    Secondly,print the characters who’s index are the multiple of 3.
    Thirdly, print the characters who’s index are the multiple of 2.If it has been printed,just ignore it .
    At last,print the characters that have not been printed.
     
    Input
    Each case will contain a string in one line.You may suppose the length of the string will not exceed 200.
     
    Output
    For each case, output the encoded string in one line.
     
    Sample Input
    ARE YOU AC?
     
    Sample Output
    EU?RYCAOA
     1 #include<stdio.h>
     2 #include<string.h>
     3 int main()
     4 { 
     5     char str1[200],str2[200];
     6     int i,k;
     7     while(gets(str1))
     8     {
     9              k=1;
    10          for(i=0;str1[i]!='';i++)
    11         {
    12             if(str1[i]!=' ')
    13                str2[k++]=str1[i];
    14         }
    15         str2[k]='';
    16     
    17      for(i=1;i<k;i++)
    18     {
    19         if(i%3==0)
    20         {
    21             printf("%c",str2[i]);
    22             str2[i]='0';
    23         }
    24     }
    25     for(i=1;i<k;i++)
    26     {
    27         if(i%2==0&&str2[i]!='0')
    28         {
    29             printf("%c",str2[i]);
    30             str2[i]='0';
    31         }
    32     }
    33     for(i=1;i<k;i++)
    34         if(str2[i]!='0')
    35            printf("%c",str2[i]);
    36      printf("
    ");
    37     }
    38     return 0;
    39 }
    40           
    41   
     
  • 相关阅读:
    poj1179 Polygon
    poj2677 Tour
    MariaDB10多实例--mysqld_multi
    MariaDB10源码安装
    linux下php+freetds连接SQL server2012
    MariaDB yum安装
    mongoDB yum安装
    pxe 引导clonezilla live万能备份与还原
    (转) pppd 中文man页面
    Unix-like DisplayManager/LoginManager/WindowManager
  • 原文地址:https://www.cnblogs.com/cancangood/p/3407398.html
Copyright © 2011-2022 走看看