【PAT A1100】 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.

Attention
这里给几个我出错的样例:

tret
jou
13

Sample

#include <cstdio>
#include <string>
#include <iostream>
#include <map>
#include <stack>
using namespace std;

//字符串表示的十进制数转成int
int str2int(string str){
	int num = 0;
	for(int i = 0; i < str.length(); i++)
		num = num * 10 + (str[i] - '0');
	return num;
}

int main(){
	//预处理建立火星数与地球数的对应关系
	//火星数2地球数
	string firDigit[13] = {"tret", "jan", "feb", "mar", "apr", "may", "jun", \
							"jly", "aug", "sep", "oct", "nov", "dec"};
	string secDigit[13] = {"tret", "tam", "hel", "maa", "huh", "tou", "kes", \
							"hei", "elo", "syy", "lok", "mer", "jou"};
	//地球数2火星数
	map<string, int> m;
	for(int i = 0; i < 13; i++){
		m[firDigit[i]] = i;
		m[secDigit[i]] = i * 13; //如果不在这里判断后面会很麻烦,比如你输入tam的时候
	}


	int N;
	scanf("%d", &N);
	getchar();
	while(N--){
		string input;
		getline(cin, input);
		//输入的字符串是地球文
		if(input[0] >= '0' && input[0] <= '9'){
			int n = str2int(input);
			if(n == 0)
				cout << "tret" << endl;
			else{
				//输出与计算的位数顺序相反用栈
				stack<int> ans;
				while(n != 0){
					ans.push(n % 13);
					n /= 13;
				}
				//有两位
				if(ans.size() > 1){
					//输出高位
					cout << secDigit[ans.top()];
					ans.pop();
					if(ans.top() != 0)
						cout << " " << firDigit[ans.top()];
					cout << endl;
				}
				else
					cout << firDigit[ans.top()] << endl;
			}	
		}
		//输入的是火星文
		else{
			//输入的是两位数
			if(input.length() > 5){
				string highDigit = input.substr(0, 3), lowDigit = input.substr(4, input.length());
				cout << m[highDigit] + m[lowDigit] << endl;
			}
			else{
				cout << m[input] << endl;
			}
		}
	}

	return 0;
}
发布了30 篇原创文章 · 获赞 1 · 访问量 1万+

猜你喜欢

转载自blog.csdn.net/lvmy3/article/details/104119264
今日推荐