PAT 甲级 1061 Dating

PAT 甲级 1061 Dating

注意不能用isupper,因为不是所有大写字母都有效。

#include<bits/stdc++.h>
using namespace std;
map<char, string> which_day_in_a_week{
    {'A',"MON"},{'B',"TUE"},{'C',"WED"},{'D',"THU"},{'E',"FRI"},{'F',"SAT"},{'G',"SUN"}
};
map<char, string> hh{
    {'0',"00"},{'1',"01"},{'2',"02"},{'3',"03"},{'4',"04"},{'5',"05"},{'6',"06"},
    {'7',"07"},{'8',"08"},{'9',"09"},{'A',"10"},{'B',"11"},{'C',"12"},{'D',"13"},
    {'E',"14"},{'F',"15"},{'G',"16"},{'H',"17"},{'I',"18"},{'J',"19"},{'K',"20"},
    {'L',"21"},{'M',"22"},{'N',"23"}
};
 
int main()
{
#ifdef LOCAL
    freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
#endif
    string s1, s2, s3, s4; cin >> s1 >> s2 >> s3 >> s4;
    int sz1 = (s1.size() < s2.size() ? s1.size() : s2.size());
    int i = 0;
    //星期
    for (i = 0; i < sz1; ++i) {
        if (s1[i] == s2[i] && s1[i] >= 'A'&&s1[i] <= 'G') {
            cout << which_day_in_a_week[s1[i]] << " ";
            break;
        }
    }
    //小时
    ++i;
    for (; i < sz1; ++i) {
        if (s1[i] == s2[i] && (isdigit(s1[i]) || (s1[i] >= 'A' && s1[i] <= 'N'))) {
            cout << hh[s1[i]] << ":";
                break;
        }
    }
    //分钟
    int sz2 = (s3.size() < s4.size() ? s3.size() : s4.size());
    for (int i = 0; i < sz2; ++i) {
        if (s3[i] == s4[i] && isalpha(s3[i])) {
            printf("%02d\n", i);
            break;
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值