1061. Dating (20)

末蓝、 2022-05-30 01:15 219阅读 0赞

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:

  1. 3485djDkxh4hhGE
  2. 2984akDfkkkkggEdsb
  3. s&hgsfdk
  4. d&Hyscvnm

Sample Output:

  1. THU 14:04

题目大意:

代码:

  1. #include<stdio.h>
  2. #include<string.h>
  3. char week[][10]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
  4. int main()
  5. {
  6. int i,j,n,m,k,t,flag=0;
  7. char str1[100],str2[100],str3[100],str4[100];
  8. scanf("%s %s %s %s",str1,str2,str3,str4);
  9. for(i=0;i<strlen(str1)&&i<strlen(str2);i++)
  10. {
  11. if(str1[i]==str2[i])
  12. {
  13. if(str1[i]>='A'&&str1[i]<='G'&&flag==0)
  14. {
  15. printf("%s ",week[str1[i]-'A']);
  16. flag=1;
  17. }
  18. else if(flag==1)
  19. {
  20. if(str1[i]>='0'&&str1[i]<='9')
  21. {
  22. printf("%02d:",str1[i]-'0');
  23. break;
  24. }
  25. else if(str1[i]>='A'&&str1[i]<='N')
  26. {
  27. printf("%d:",str1[i]-'A'+10);
  28. break;
  29. }
  30. }
  31. }
  32. }
  33. for(i=0;i<strlen(str3)&&i<strlen(str4);i++)
  34. {
  35. if((str3[i]==str4[i])&&((str3[i]>='a'&&str3[i]<='z')||(str3[i]>='A'&&str3[i]<='Z')))
  36. {
  37. printf("%02d",i);
  38. break;
  39. }
  40. }
  41. return 0;
  42. }

发表评论

表情:
评论列表 (有 0 条评论,219人围观)

还没有评论,来说两句吧...

相关阅读

    相关 1061. 判断题(15)

    判断题的评判很简单,本题就要求你写个简单的程序帮助老师判题并统计学生们判断题的得分。 输入格式: 输入在第一行给出两个不超过100的正整数N和M,分别是学生人数和判断题数量

    相关 PAT乙级1061

    1061 判断题 (15 分) 判断题的评判很简单,本题就要求你写个简单的程序帮助老师判题并统计学生们判断题的得分。 输入格式: 输入在第一行给出两个不超过 100