1061 Dating (20point(s)) Easy only once *草蛋审题

基本思想：

没啥难度，就是审题障碍，到底是同位置第一对还是不同位置第一对元素，英文题确实审题障碍；

关键点：

无；

 1 #include<iostream>
 2 #include<stdlib.h>
 3 #include<stdio.h>
 4 #include<vector> 
 5 #include<string>
 6 #include<math.h>
 7 #include<algorithm>
 8 using namespace std;
 9 using std::vector;
10 bool shash[30] = { false };
11 vector<int>vec;
12 vector<string>date = { "MON" ,"TUE","WED","THU","FRI","SAT","SUN" };
13 int main() {
14     string a, b, c, d;
15     cin >> a >> b >> c >> d;
16     int index;
17     int cnt = 0;
18     for (int i = 0; i < a.size() && i < b.size(); i++) {
19         if (a[i] == b[i] && a[i] >= 'A'&&a[i] <= 'G') {
20             vec.push_back(a[i] - 'A');
21             cnt = i;
22             break;
23         }
24     }
25     for (int i = cnt+1; i < a.size() && i < b.size(); i++) {
26         if (a[i] == b[i])
27             if (a[i] >= '0'&&a[i] <= '9') {
28                 vec.push_back(a[i] - '0');
29                 break;
30             }
31             else if (a[i] >= 'A'&&a[i] <= 'N') {
32                 vec.push_back(a[i] - 'A' + 10);
33                 break;
34             }
35     }
36     for (int i = 0; i < c.size() && i < d.size(); i++) {
37         if (c[i] == d[i]&&((c[i]>='a'&&c[i]<='z')|| (c[i] >= 'A'&&c[i] <= 'Z'))) {
38             index = i;
39             //cout << c[i] << endl;
40             break;
41         }
42     }
43     printf("%s %02d:%02d", date[vec[0]].c_str(),vec[1],index);
44     system("pause");
45     return 0;
46 }