1061 Dating

最新推荐文章于 2024-08-10 15:25:17 发布

hmsjdzzj

最新推荐文章于 2024-08-10 15:25:17 发布

阅读量69

点赞数

分类专栏： zzj的PAT 文章标签：算法 c++ pat考试

本文链接：https://blog.csdn.net/hmsjdzzj/article/details/131168518

版权

zzj的PAT 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

##### 8、解密-约会日期✔

#include<iostream>
#include<cstring>
using namespace std;
int main(){
    string s1,s2,s3,s4;
    cin>>s1>>s2>>s3>>s4;

    int n=s1.size();
    int i=0;
    for(;i<n;i++){
        if(s1[i]==s2[i]){
            if(s1[i]=='A') cout<<"MON ";
            else if(s1[i]=='B') cout<<"TUE ";
            else if(s1[i]=='C') cout<<"WED ";
            else if(s1[i]=='D') cout<<"THU ";
            else if(s1[i]=='E') cout<<"FRI ";
            else if(s1[i]=='F') cout<<"SAT ";
            else if(s1[i]=='G') cout<<"SUN ";
            else continue;
            break;
        }
    }
    i++;
    for(;i<n;i++){
        if(s1[i]==s2[i]){
            if(s1[i] >='0' && s1[i]<='9') cout<<"0"<<s1[i]<<":";
            else if(s1[i] >='A' && s1[i]<='N') cout<<10+(int)(s1[i]-'A')<<":";
            else continue;
            break;
        }
    }

    n=s3.size();
    for(int i=0;i<n;i++){
        if(s3[i]==s4[i] && (          (s3[i]>='a' && s3[i]<='z')||(s3[i]>='A' && s3[i]<='Z')      )   ) {
            if(i<10) cout<<"0"<<i<<endl;
            else cout<<i<<endl;
            break;
        }
    }
}