1061. Dating
来源:互联网 发布:windows ssh客户端 编辑:程序博客网 时间:2024/06/05 11:16
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 65bool 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; }
- 1061. Dating
- 1061.Dating
- 1061. Dating
- 1061. Dating
- 1061. Dating
- 1061. Dating
- 1061. Dating (20)-PAT
- 【PAT】1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- PAT 1061. Dating
- PAT 1061. Dating
- PAT 1061. Dating (20)
- pat 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- 1061. Dating (20)
- NoSQL反模式 - 文档数据库篇
- jQuery炫酷插入和移动元素动画特效插件
- Java的HashMap与LinkedHashMap异同
- (单片机原理与应用)proteus(嵌入式系统设计仿真与开发平台)的使用和编译环境(汇编版)
- 国内svn云服务地址汇总
- 1061. Dating
- 第一个swift程序
- (单片机原理与应用)keilC51编译环境的使用(C版和汇编版)
- Android源码分析--system_server进程分析
- NS2 学习笔记—— AODV协议
- iOS 设置控件全局显示样式appearance proxy
- opengl矩阵堆栈的常识
- Linux学习笔记(7)
- shrink_to_fit() demo