1061. Dating (20)
来源:互联网 发布:sql server 2005 xp版 编辑:程序博客网 时间:2024/05/21 06:51
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&HyscvnmSample Output:
THU 14:04
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char str1[100],str2[100],str3[100],str4[100];char week[][4]={"MON","TUE","WED","THU","FRI","SAT","SUN"};int main(){ cin>>str1>>str2>>str3>>str4; int len1=min(strlen(str1),strlen(str2)); int len2=min(strlen(str3),strlen(str4)); char data,hour; int minute; int t=0; for (int i=0;i<len1;i++) { if(str1[i]==str2[i]&&t==0&&str1[i]>='A'&&str1[i]<='G') { data=str1[i]; t=1; } else if (str1[i]==str2[i]&&t==1&&((str1[i]>='A'&&str1[i]<='N')||(str1[i]>='0'&&str1[i]<='9'))) { hour=str1[i]; break; } } for (int i=0;i<len2;i++) { if (str3[i]==str4[i]&&isalpha(str3[i])) { minute=i; break; } } printf("%s ",week[data-'A']); if(isdigit(hour)) printf("%02d",hour-'0'); else printf("%02d",hour-'A'+10); printf(":%02d",minute); return 0;}
- 1061. Dating (20)-PAT
- 【PAT】1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- pat 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- pat 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating (20)
- 1061. Dating (20)
- java 数组的学习
- Nginx反向代理通过域名无法访问项目的解决办法
- VS2015在x86平台下找不到包含目录的问题
- 为git配置代理
- 翁恺老师第二周作业
- 1061. Dating (20)
- 我的HTML学习笔记
- [阅读笔记]AutoRec: Autoencoders Meet Collaborative Filtering
- 欢迎使用CSDN-markdown编辑器
- Linux 设备树学习
- DOM模型
- 输入法泄露处理工具类
- F
- 微信小程序rsa分段加密