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.

真的是折磨人,线一直拖一直拖,之前说8号,现在说11号,根本无法想象是用什么样的心情写完这题

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 65
bool Check1 (char a,char b);
bool Check2 (char a,char b);
bool Check3 (char a,char b);
void Day (char a);
void Hour (char a);
int main ()
{
    char first[N],second[N],third[N],forth[N];
    gets(first);
    gets(second);
    gets(third);
    gets(forth);
    int len1=strlen(first),len2=strlen(second),len3=strlen(third),len4=strlen(forth);
    int i,j;
    for( i=0;i<len1&&i<len2;i++)
    {
         if( Check1(first[i],second[i])) break;
         }
    Day(first[i]);
    i++;
    for( ;i<len1&&i<len2;i++)
    {
         if( Check2(first[i],second[i])) break;
         }
    Hour(first[i]);
    for( i=0;i<len3&&i<len4;i++)
    {
         if( Check3(third[i],forth[i])) break;
         }
    printf(":%.2d\n",i);
    system("pause");
    return 0;
    }
void Hour (char a)
{
     if( a-'0'>=0&&a-'9'<=0)
     {
         printf("%.2d",a-'0');
         }
     else printf("%.2d",a-'A'+10);
     }
void Day (char a)
{
     switch (a)
     {
            case 'A':printf("MON ");return ;
            case 'B':printf("TUE ");return ;
            case 'C':printf("WED ");return ;
            case 'D':printf("THU ");return ;
            case 'E':printf("FRI ");return ;
            case 'F':printf("SAT ");return ;
            case 'G':printf("SUN ");return ;
            }
     }
bool Check1 (char a,char b)
{
     if( a-b==0)
     {
         if( a-'A'>=0 && a-'G'<=0) return true;
         else return false;
         }
     else return false;
     }
bool Check2 (char a,char b)
{
     if( a-b==0)
     {
         if(( a-'0'>=0 &&a-'9'<=0)||(a-'A'>=0&&a-'N'<=0)) return true;
         else return false;
         }
     else return false;
     }
bool Check3 (char a,char b)
{
     if( a-b==0)
     {
         if( a-'a'>=0&&a-'z'<=0) return true;
         else return false;
         }
     return false;
     }
时间: 2024-10-29 04:24:24

1061. Dating的相关文章

PAT 1061. Dating (20)

1 #include <iostream> 2 #include <string> 3 4 using namespace std; 5 6 int main() 7 { 8 string s1, s2, s3, s4; 9 cin >> s1 >> s2 >> s3 >> s4; 10 string day[7]{"MON", "TUE", "WED", "THU

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:0

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:0

1061. Dating (20)

1 #include <stdio.h> 2 #include <map> 3 #include <string.h> 4 #include <ctype.h> 5 using namespace std; 6 int main() 7 { 8 map<char,int> ToHour; 9 int i; 10 for(i=0;i<=9;i++) 11 ToHour['0'+i]=i; 12 for(i='A';i<='N';i++)

PAT 1061. Dating

题是别人出的,不按她的想法来也没办法,真心想k一顿 #include <cstdio> #include <cstdlib> using namespace std; const char* days[] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"}; inline bool is_ca

PAT (Advanced Level) 1061. Dating (20)

简单模拟. #include<stdio.h> #include<string.h> char s1[70],s2[70],s3[70],s4[70]; char f[7][5]={"MON ", "TUE ","WED ","THU ","FRI ","SAT ","SUN "}; int a,b,c,flag; int main() { s

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 minut

A题目

1 1001 A+B Format(20) 2 1002 A+B for Polynomials(25) 3 1003 Emergency(25) 4 1004 Counting Leaves(30) 5 1005 Spell It Right(20) 6 1006 Sign In and Sign Out(25) 7 1007 Maximum Subsequence Sum(25) 8 1008 Elevator(20) 9 1009 Product of Polynomials(25) 10

PAT甲级题分类汇编——线性

线性类,指线性时间复杂度可以完成的题.在1051到1100中,有7道: 题号 标题 分数 大意 时间 1054 The Dominant Color 20 寻找出现最多的数 200ms 1061 Dating 20 寻找字符串中相同字符 200ms 1071 Speech Patterns 25 寻找出现最多的单词 300ms 1077 Kuchiguse 20 字符串共同后缀 150ms 1082 Read Number in Chinese 25 中文读数 400ms 1084 Broken