PAT甲级——1100 Mars Numbers (字符串操作、进制转换)

本文同步发布在CSDN：https://blog.csdn.net/weixin_44385565/article/details/90678474

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 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 (<). 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

题目大意：火星人用13进制计数，把地球的十进制与火星的13进制相互转换，需要注意的是火星人的数字是字符形式。 

思路：映射火星人的数字与字符，用string存储读取的一整行数据，要调用getline()函数，它会读取一行里包括空格在内的所有字符。注意一下火星人的数字超过13时，0~12映射的字符也会变化，需要加入判断~

#include <iostream>
#include <string>
#include <map>
using namespace std;
string Earth_Mars[25] = { "tret",
                        "jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec",
                        "tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou" };
map <string, int> Mars_Earth;
void init();
void earthToMars(string &s);
void marsToEarth(string &s);
int main()
{
    init();
    int N;
    scanf("%d", &N);
    getchar();
    for (int i = 0; i < N; i++) {
        string s;
        getline(cin, s);
        if (s[0] >= '0' && s[0] <= '9')
            earthToMars(s);
        else
            marsToEarth(s);
    }
    return 0;
}
void marsToEarth(string &s) {
    if (s == "tret") {
        cout << Mars_Earth[s] << endl;
        return;
    }
    int size = s.size();
    if (size < 4)
        cout << Mars_Earth[s] << endl;
    else {
        string s1 = s.substr(0, 3),
            s2 = s.substr(4, 3);
        cout << Mars_Earth[s1] + Mars_Earth[s2] << endl;
    }
}
void earthToMars(string &s) {
    int earth = 0;
    for (int i = 0; i < s.length(); i++)
        earth = earth * 10 + s[i] - '0';
    if (earth <= 12) {
        cout << Earth_Mars[earth] << endl;
        return;
    }
    else if (earth % 13 == 0) {
        cout << Earth_Mars[earth / 13 + 12] << endl;
        return;
    }
    string mars[2];
    mars[1] = Earth_Mars[earth % 13];
    earth = earth / 13;
    mars[0] = Earth_Mars[earth + 12];
    cout << mars[0] << " " << mars[1] << endl;
}
void init() {
    for (int i = 0; i < 13; i++)
        Mars_Earth[Earth_Mars[i]] = i;
    for (int i = 13; i < 25; i++)
        Mars_Earth[Earth_Mars[i]] = (i - 12) * 13;
}