PAT BASIC 1014 福尔摩斯的约会

来源：互联网发布：点击链接直接下载 js 编辑：程序博客网时间：2024/05/17 03:04

思路：

一个判定条件比较复杂的字符串处理题，感觉又是题目表达得不太明确，没什么特别要注意的，条件之间的&&和||关系不要搞错就好了。

代码：

#include<iostream>#include<string>using namespace std;string a, b;int len, week, hour, minu;string eWeek[7] = { "MON ", "TUE ", "WED ", "THU ", "FRI ", "SAT ", "SUN " };int main(){  int i, j;  cin >> a >> b;  len = 0;  while (!(a[len] == b[len] && a[len] >= 'A' && a[len] <= 'G'))    len++;  week = a[len] - 'A';  len++;  while (!(a[len] == b[len] && ((a[len] >= 'A' && a[len] <= 'N') || (a[len] >= '0' && a[len] <= '9'))))    len++;  if (a[len] >= '0' && a[len] <= '9')    hour = a[len] - '0';  else hour = a[len] - 'A' + 10;  cin >> a >> b;  len = 0;  while (!(a[len] == b[len] && ((a[len] >= 'a' && a[len] <= 'z') || (a[len] >= 'A' && a[len] <= 'Z'))))    len++;  minu = len;  cout << eWeek[week];  if (hour < 10)    cout << "0";  cout << hour << ":";  if (minu < 10)    cout << "0";  cout << minu;  //while (1)  //{  //}  return 0;}

0 0