1061. Dating (20)解题报告
2016-10-31 09:49
507 查看
#define _CRT_SECURE_NO_WARNINGS #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #define N 100 int main(void) { char days[7][7] = { "MON", "TUE","WED","THU","FRI","SAT","SUN" }; char str1 , str2 , str3 , str4 ; scanf("%s %s %s %s", str1, str2, str3, str4); char first, sec; int i, third; for (i = 0; i < strlen(str1) && i < strlen(str2); i++) { if (str1[i] == str2[i] && str1[i] >= 'A' && str1[i] <= 'G') { first = str1[i]; break; } } for (i++; i < strlen(str1) && i < strlen(str2); i++) { if (str1[i] == str2[i] && ((str1[i] >= 'A' && str1[i] <= 'N') || isdigit(str1[i]))) { sec = str1[i]; break; } } for (i = 0; i < strlen(str3) && i < strlen(str4); i++) { if (str3[i] == str4[i] && isalpha(str4[i])) { third = i; break; } } printf("%s %02d:%02d\n", days[first - 'A'], sec >= '0' && sec <= '9' ? sec - '0' : sec - 'A' + 10, third); return 0; }
相关文章推荐
- 1061. Dating (20)
- 1084. Broken Keyboard (20)解题报告
- 1061. Dating (20)
- 1112. Stucked Keyboard (20)解题报告
- 关于‘1001.A+B Format (20)’的解题报告
- 【LeetCode】20.Valid Parentheses解题报告
- PAT 1061. Dating (20)
- 1061. Dating (20)
- 解题报告 :POJ1061 青蛙的约会 数论/扩展欧几里德模板题
- poj1061青蛙的约会解题报告
- 1081. Rational Sum (20)解题报告
- 1061. Dating (20)
- [Updating] Educational Codeforces Round 20 解题报告
- PAT-A 1061. Dating (20)
- 1088. Rational Arithmetic (20)解题报告
- 1061. Dating (20)
- 1061. Dating (20)
- JOJ 1061: Rank The Teams 解题报告
- PAT (Advanced Level) 1035. Password (20) 解题报告
- PAT (Advanced Level) Practise 1061 Dating (20)