1100. Mars Numbers (20)

题目链接：点击打开链接

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string gewei[13]={"tret","jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};
string shiwei[12]={"tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"};
map<string,int>q;
int main(){
    for(int i=0;i<13;i++)   q[gewei[i]]=i;
    for(int i=0;i<12;i++)   q[shiwei[i]]=(i+1)*13;

    int n;
    cin>>n;

    getchar();
    while(n--){
        string s;
        getline(cin,s);
        int len=s.length();
        if(s[0]>='0'&&s[0]<='9'){
            int t=0;
            for(int i=0;i<len;i++){
                t=t*10+(int)(s[i]-'0');
            }
            int t1=0,t2=0;
            t2=t%13;
            t/=13;
            if(t>0)t1=t;
            if(t>0&&t2!=0)cout<<shiwei[t1-1]<<' '<<gewei[t2]<<endl;
            else if(t>0&&t2==0)cout<<shiwei[t1-1]<<endl;
            else if(t==0)cout<<gewei[t2]<<endl;
        }
        else{
                string temp1,temp2;int flag=0;
            for(int i=0;i<len;i++){
                if(s[i]==' '){flag=1;continue;}
                if(flag==0){
                    temp1+=s[i];
                }
                else {
                    temp2+=s[i];
                }
            }
            if(flag)cout<<q[temp1]+q[temp2]<<endl;
            else cout<<q[temp1]<<endl;
        }
    }
    return 0;
}