1100. Mars Numbers (20)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
People on Mars count their numbers with base 13:
- Zero on Earth is called "tret" on Mars.
- The numbers 1 to 12 on Earch is called "jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec" on Mars, respectively.
- For the next higher digit, Mars people name the 12 numbers as "tam, hel, maa, huh, tou, kes, hei, elo, syy, lok, mer, jou", respectively.
For examples, the number 29 on Earth is called "hel mar" on Mars; and "elo nov" on Mars corresponds to 115 on Earth. In order to help communication between people from these two planets, you are supposed to write a program for mutual translation between Earth and Mars number systems.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (< 100). Then N lines follow, each contains a number in [0, 169), given either in the form of an Earth number, or that of Mars.
Output Specification:
For each number, print in a line the corresponding number in the other language.
Sample Input:4 29 5 elo nov tamSample Output:
hel mar may 115 13 #include<cstdio> #include <string> #include <iostream> #include<math.h> #include<map> using namespace std; char b[10] = {}; map<string,int> mp1; map<string,int> mp2; int main(){ int num; string a[13] = {"tret","jan", "feb", "mar", "apr", "may", "jun", "jly","aug", "sep", "oct", "nov", "dec"}; string b[13] = {"tret","tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"}; for(int i=0;i<13;i++){ mp1[a[i]] = i; mp2[b[i]] = i; } scanf("%d",&num); for(int i=0;i<num;i++){ string s,s2; cin>>s; if( getchar() == ' ') { cin>>s2; } if('0'<=s[0]&&s[0]<='9'){ int l = s.length()-1; int numR = 0; for(int i=0;i<s.length();i++){ numR += (s[i]-'0')*pow(10, l--); } int low = numR%13; int high = numR/13; if(high==0){ cout <<a[low]<<"\n"; }else if(high!=0&&low==0){ cout<<b[high]<<"\n"; }else{ cout<<b[high]<<" "<<a[low]<<"\n"; } }else{ if(s2.length()==0){ for(int i=0;i<13;i++){ if(s==a[i]){ printf("%d\n",mp1[a[i]]); break; } if(s==b[i]){ printf("%d\n",mp2[b[i]]*13); break; } } }else{ int sum = mp2[s]*13+mp1[s2]; printf("%d\n",sum); } } } return 0; }