PAT 甲级 1100 Mars Numbers (20 分)

Note

• map
• 细心！！！

Code

#include<bits/stdc++.h>
using namespace std;

map<string,int> high,low;
string gaowei[13]={"000","tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"};
string diwei[13]={"tret","jan","feb","mar","apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};
void to_mars(int n){
	if(n<13) cout<<diwei[n]<<endl;
	else{
		cout<<gaowei[n/13];
		if(n%13!=0) cout<<" "<<diwei[n%13];
		cout<<endl;
	}
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("data.txt","r",stdin);
	#endif
	
	int n;
	string s;
	scanf("%d",&n);
	getchar();
	for(int i=0;i<13;i++){
		high[gaowei[i]]=i;
		low[diwei[i]]=i;
	}
	for(int i=0;i<n;i++){
		getline(cin,s);
		if(isdigit(s[0])) to_mars(stoi(s));
		else{
			int ans=0;
			if(s.size()>4){
				string s1=s.substr(0,3);
				string s2=s.substr(4);
				ans+=high[s1]*13;
				ans+=low[s2]; 
			}
			else{
				if(high[s]!=0) ans=high[s]*13;
				else ans=low[s];
			}
			cout<<ans<<endl;
		}
	}
	
	return 0;
}