• pat1061. Dating (20)


    1061. Dating (20)

    时间限制
    50 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    Sherlock Holmes received a note with some strange strings: "Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm". It took him only a minute to figure out that those strange strings are actually referring to the coded time "Thursday 14:04" -- since the first common capital English letter (case sensitive) shared by the first two strings is the 4th capital letter 'D', representing the 4th day in a week; the second common character is the 5th capital letter 'E', representing the 14th hour (hence the hours from 0 to 23 in a day are represented by the numbers from 0 to 9 and the capital letters from A to N, respectively); and the English letter shared by the last two strings is 's' at the 4th position, representing the 4th minute. Now given two pairs of strings, you are supposed to help Sherlock decode the dating time.

    Input Specification:

    Each input file contains one test case. Each case gives 4 non-empty strings of no more than 60 characters without white space in 4 lines.

    Output Specification:

    For each test case, print the decoded time in one line, in the format "DAY HH:MM", where "DAY" is a 3-character abbreviation for the days in a week -- that is, "MON" for Monday, "TUE" for Tuesday, "WED" for Wednesday, "THU" for Thursday, "FRI" for Friday, "SAT" for Saturday, and "SUN" for Sunday. It is guaranteed that the result is unique for each case.

    Sample Input:
    3485djDkxh4hhGE 
    2984akDfkkkkggEdsb 
    s&hgsfdk 
    d&Hyscvnm
    
    Sample Output:
    THU 14:04
    

    提交代码

    劣题。题意不清,并没有说明两字符串字符对应相等的含义竟然是字符大小和字符在本身字符串的位置也要相等,故为上等劣题,纯粹为了做题而做题!

    以下是我认为对的代码:

     1 #include<stdio.h>
     2 #include<stdlib.h>
     3 #include<string.h>
     4 #include<iostream>
     5 using namespace std;
     6 
     7 const int N=80;
     8 char w[7][4]={{"MON"},{"TUE"},{"WED"},{"THU"},{"FRI"},{"SAT"},{"SUN"}};
     9 int main()
    10 {
    11     char s1[N],s2[N],s3[N],s4[N];
    12     scanf("%s%s%s%s",s1,s2,s3,s4);
    13     int i=0;
    14     int week,hh,mm;
    15     while(i<strlen(s1)&&i<strlen(s2)){
    16         if(s1[i]==s2[i]&&s1[i]>='A'&&s1[i]<='G'){
    17             week=s1[i]-'A';
    18             break;
    19         }
    20         i++;
    21     }
    22     i++;
    23     while(i<strlen(s1)&&i<strlen(s2)){
    24         if(s1[i]==s2[i]&& ((s1[i]>='A'&&s1[i]<='N')||(s1[i]>='0'&&s1[i]<='9'))){
    25             if((s1[i]>='A'&&s1[i]<='N'))
    26                 hh=s1[i]-'A'+10;
    27             else if(s1[i]>='0'&&s1[i]<='9')
    28                 hh=s1[i]-'0';
    29             break;
    30         }
    31         i++;
    32     }
    33     i=0;
    34     while(i<strlen(s3)&&i<strlen(s4)){
    35         if(s3[i]==s4[i]&&((s3[i]>='A'&&s3[i]<='Z')||(s3[i]>='a'&&s3[i]<='z'))){
    36             mm=i;
    37             break;
    38         }
    39         i++;
    40     }
    41     printf("%s %02d:%02d
    ",w[week],hh,mm);
    42     return 0;
    43 }
  • 相关阅读:
    编程思想之多线程与多进程——以操作系统的角度述说线程与进程
    git 版本回退
    git 版本回退
    求助帖:android开发初期:为什么我在活动二设置的singInstance模式跑到活动三去了???
    求助帖:android开发初期:为什么我在活动二设置的singInstance模式跑到活动三去了???
    Android初学:Gradle 'HelloWorld' project refresh failed
    处理日期时间方法总结
    解决error104 connection reset by peer;socket error问题
    'utf8' codec can't decode byte 0xd1 in position 931: invalid continuation byte解决方法
    scrapy学习笔记
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4779367.html
Copyright © 2020-2023  润新知