即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

PAT-A-1061. Dating (20)

编程语言 doglovecow 20℃ 0评论
本文目录
[隐藏]

1. 1061. Dating (20)

时间限制
150 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
#include
#include
#include

using namespace std;
string week[7] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };

int main()
{
  string s1, s2, s3, s4;
  cin >> s1 >> s2 >> s3 >> s4;

  int day;
  int hour;
  int min;

  int len1 = s1.size();
  int len2 = s2.size();
  int i;
  for (i = 0; i < len1&&i < len2; i++)
  {
    if (s1[i] == s2[i] && s1[i] >= 'A'&&s1[i] <= 'G')
    {        
      day = s1[i] - 'A';
      break;
    }
  }

  for (i = i + 1; i < len1&&i < len2; i++)
  {
    if (s1[i] == s2[i])
    {
      if (s1[i] <= '9'&&s1[i] >= '0')
      {
        hour = s1[i] - '0';
        break;
      }
      else if (s1[i] <= 'N'&&s1[i] >= 'A')
      {
        hour = s1[i] - 'A' + 10;
        break;
      }
    }
  }
  
  len1 = s3.size();
  len2 = s4.size();
  for (i = 0; i < len1&&i < len2; i++)
  {
    if (s3[i] == s4[i])
      if ((s3[i] <= 'z'&&s3[i] >= 'a') || (s3[i] <= 'Z'&&s3[i] >= 'A'))
        min = i;
  }

  cout << week[day] << " ";
  printf("%02d:%02d", hour, min);
  
  system("pause");
  return 0;
}


转载请注明:CodingBlog » PAT-A-1061. Dating (20)

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情