zoukankan      html  css  js  c++  java
  • 1061. Dating (20)

    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
    #include<cstdio>
    #include<cstring>
    char week[10][5] = {
        "MON","TUE","WED","THU","FRI","SAT","SUN"
    };
    int main(){
        char str1[65],str2[65],str3[65],str4[65];
        gets(str1);
        gets(str2);
        gets(str3);
        gets(str4);
        int len1 = strlen(str1);
        int len2 = strlen(str2);
        int len3 = strlen(str3);
        int len4 = strlen(str4);
        
        int i;
        for(i = 0; i < len1 && i < len2; i++){
            if(str1[i] == str2[i] && str1[i] >= 'A' && str1[i] <= 'G'){
                printf("%s ",week[str1[i] - 'A']);
                break;
            }
        }
        for(i++; i < len1 && i < len2; i++){
            if(str1[i] == str2[i]){
                if(str1[i] >= '0' && str1[i] <= '9'){
                    printf("%02d",str1[i] - '0');
                    break;
                }else if(str1[i] >= 'A' && str1[i] <='N'){
                    printf("%d",str1[i] - 'A' + 10);
                    break;
                }
            }
        }
        for(i = 0; i < len3 && i < len4; i++){
          if(str3[i] == str4[i]){
                 if((str3[i] >= 'A' && str3[i] <= 'Z') || (str3[i] >= 'a' && str4[i] <= 'z')){
                     printf(":%02d
    ",i);
                     break;
                 }
            }
        }
        return 0;
    }
  • 相关阅读:
    redis和memcache的区别
    c语言行编辑程序
    C语言栈的实现
    双向链表
    静态链表的合并
    静态链表的创建
    链表
    将非递减有序排列(L L1)归并为一个新的线性表L2 线性表L2中的元素仍按值非递减
    C语言合并两个集合(L,L1) 将L1中不在L中的元素插入到L线性表中
    oracle--JOB任务
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/8544487.html
Copyright © 2011-2022 走看看