1100. Mars Numbers (20)
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<stdio.h> #include<iostream> #include<string> #include<algorithm> using namespace std; string lowerbit[13] = { "tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"}; string higherbit[13] = { "", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"}; string earthToMar(int x) { if(x / 13 == 0) return lowerbit[x]; else if(x % 13 == 0) return higherbit[x/13]; else return higherbit[x/13] + " " + lowerbit[x%13]; } int marToEarth(string x) { int a = 0, b = 0;//a 表示个位,b表示十位 int index = x.find(" "); if(index == string::npos)//若没有空格 { for(int i = 0; i < 13; i ++) { if(lowerbit[i] == x)//是个位 { a = i; break; } if(higherbit[i] == x) { b = i; break; } } } else//是两个字符串 { string b_str = x.substr(0, index); string a_str = x.substr(index+1, x.size()-index); for(int i = 0; i < 13; i ++) { if(b_str == higherbit[i]) { b = i; break; } } for(int i = 0; i < 13; i ++) { if(a_str == lowerbit[i]) { a = i; break; } } } return b*13 + a; } int main() { freopen("F://Temp/input.txt", "r", stdin); int n; cin>>n; getchar();//读取最后的回车符 string str; while(n --) { getline(cin, str);//读取整行 if(str[0] >= '0' && str[0] <= '9') cout<<earthToMar(atoi(str.c_str()))<<endl; else cout<<marToEarth(str)<<endl; } return 0; }