zoukankan      html  css  js  c++  java
  • 1061 Dating

    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<iostream>
    #include<algorithm>
    #include<vector>
    #include<string>
    using namespace std;
    int main()
    {
        string ch[7] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };
        int i = 0;
        string s1, s2, s3, s4;
        cin >> s1 >> s2 >> s3 >> s4;
        int s1length = s1.length(), s2length = s2.length(), s3length = s3.length(), s4length = s4.length();
        int a = min(s1length, s2length);
        int b = min(s3length, s4length);
        for ( i = 0; i<a; i++)
        {
            if (s1[i] == s2[i])
            {
                if (s1[i] >= 'A' && s1[i] <= 'G')
                {
                    cout << ch[(s1[i] - 'A' )] << ' ';
                    break;
                }
                /*else if (s1[i] >= 97 && s1[i] <= 122)
                {
                    cout << ch[(s1[i] - 'a' )] << " ";
                    break;
                }*/
            }
        }
        for ( ++i; i<a; i++)
        {
            if (s1[i] == s2[i])
            {
                if (isdigit(s1[i]))
                {
                    printf("%02d:", s1[i]-'0');
                    break;
                }
                else if (s1[i] >= 'A'&&s1[i] <= 'N')
                {
                    printf("%02d:", (10 + s1[i] - 'A'));
                    break;
                }
            }
        }
    
        for (i = 0; i<b; i++)
        {
            if (s3[i] == s4[i] && isalpha(s3[i]))
            {
                printf("%02d
    ", i);
                break;
            }
        }
        //system("pause");
        return 0;
    }
  • 相关阅读:
    HTML5拖动画布/拖放
    随着通信和编程,它是一门艺术系列6(技术的情况)
    POJ 3652 &amp; ZOJ 2934 &amp; HDU 2721 Persistent Bits(数学 元)
    使用注解实现 bean 转 csv
    hdu4956 Poor Hanamichi
    教你如何赚你的第一桶金
    【Java 它 JVM】对象的创建过程
    c#控制台应用程序-“进入指定日期检查出星期几”
    迎接和书,这是一个很好的满足
    bloom filter与dawgdic(一种trie树)
  • 原文地址:https://www.cnblogs.com/binanry/p/10016933.html
Copyright © 2011-2022 走看看