PAT甲级 1100

题目 Mars Numbers

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.

解析

13进制，注意：当输入数为13的倍数，最后不需要输出0（26是13的倍数，只要输出2对应的火星码，0不需要输出）

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

string num[13] = {"tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"};
string num2[13] = {"tret", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"};

void pat1100() {
    int n;
    cin >> n;
    getchar();
    for (int i = 0; i < n; ++i) {
        string t;
        getline(cin, t);
        if (t[0] >= '0' && t[0] <= '9') {
            int temp;
            stringstream ss;
            ss << t;
            ss >> temp;
            int a = temp % 13;
            int b = temp / 13;
            if (a == 0) {
                cout << num2[b] << endl;
            } else if (b == 0) {
                cout << num[a] << endl;
            } else {
                cout << num2[b] << " " << num[a] << endl;
            }
        } else {
            int site = t.find(' ');
            if (site != -1) {
                string pre = t.substr(0, site);
                string back = t.substr(site + 1, t.size());
                int i_pre = 0, i_back=0;
                for (int j = 0; j < 13; ++j) {
                    if (back == num[j]) {
                        i_back = j;
                        break;
                    }
                }
                for (int j = 0; j < 13; ++j) {
                    if (pre == num2[j]) {
                        i_pre = j;
                        break;
                    }
                }
                int res = i_pre * 13 + i_back;
                cout << res << endl;
            } else {
                int res=-1;
                for (int j = 0; j < 13; ++j) {
                    if (t == num[j]) {
                        res = j;
                        break;
                    }
                }
                if(res==-1){
                    for (int j = 0; j < 13; ++j) {
                        if (t == num2[j]) {
                            res = j*13;
                            break;
                        }
                    }
                }
                cout << res << endl;
            }
        }
    }

}

int main() {
    pat1100();
    return 0;
}