PAT甲级真题 1100 Mars Numbers (20分) C++实现

题目

People on Mars count their numbers with base 13:
Zero on Earth is called “tret” on Mars.
The numbers 1 to 12 on Earth 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
tam

Sample Output:

hel mar
may
115
13

思路

水题，考察细致程度。

需要注意的是：

1. tret是4位的，不要都当做3位；
2. 当两位数的个位为0时，不用输出tret；例如输入13，直接输出tam，而不是tam tret。

代码

#include <iostream>
#include <vector>
#include <cctype>
using namespace std;

vector<string> mar1 = {"tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};
vector<string> mar2 = {"", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"};

int findIndex(string s, vector<string> &mar){
    for (int i=0; i<mar.size(); i++){
        if (s==mar[i]) return i;
    }
    return -1;
}

int main() {
    int n;
    cin >> n;
    getchar();  //吸收换行符
    string s;
    for (int i=0; i<n; i++){
        getline(cin, s);
        if (isdigit(s[0])){
            int k = stoi(s);
            if (k > 12){
                cout << mar2[k/13];
                if (k%13!=0) cout <<  " " << mar1[k%13];
            }
            else{
                cout << mar1[k];
            }
        }
        else{
            int num;
            if (s.size()>4){
                num = findIndex(s.substr(0,3), mar2) * 13 + findIndex(s.substr(4, 3), mar1);
            }
            else{
                num = findIndex(s, mar1);
                if (num==-1) num = findIndex(s, mar2) * 13;
            }
            cout << num;
        }
        cout << endl;
    }
    return 0;
}