PAT A1100 Mars Numbers (20分)

最新推荐文章于 2024-10-20 20:14:58 发布

飞哥小佛与泰瑞

最新推荐文章于 2024-10-20 20:14:58 发布

阅读量188

点赞数

分类专栏： PAT甲级文章标签： PAT 程序设计 c++ 算法

本文链接：https://blog.csdn.net/PanYiAn9/article/details/104904946

版权

PAT甲级专栏收录该内容

21 篇文章 0 订阅

订阅专栏

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)因为涉及的地球数字范围为[0,169)，所以将地球数字到火星数字的映射和火星数字到地球数字的映射都实现，即打表；
(2)打表要注意在[0,169)内，只有当地球数字为13的倍数或属于[0,13)时，对应的火星数字为一个单位，否则为两个单位.

代码：

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

string numToStr[170];
map<string,int> strToNum;
string lowDigit[15] = {"tret","jan","feb","mar","apr","may","jun",
					"jly","aug","sep","oct","nov","dec"};
string highDigit[15] = {"tret","tam","hel","maa","huh","tou","kes",
					"hei","elo","syy","lok","mer","jou"};
void init(){//对numToStr[170]、strToNum初始化 
	for(int i=0;i<13;i++){//初始化火星数字长度为一的数 
		numToStr[i] = lowDigit[i];//0-12
		strToNum[lowDigit[i]] = i;
		numToStr[i*13] = highDigit[i];//13的倍数 
		strToNum[highDigit[i]] = i*13;
	}
	for(int i=1;i<13;i++){//初始化火星数字长度为二的数
		for(int j=1;j<13;j++){
			string str = highDigit[i]+" "+lowDigit[j];
			numToStr[i*13+j] = str;//0-12
			strToNum[str] = i*13+j;
		} 
	}
}

int main(){
	init();//打表 
	int n;
	scanf("%d",&n);
	getchar();
	string str;
	while(n--){
		getline(cin,str);//获取一行 
		if(str[0]>='0'&&str[0]<='9'){
			int temp = 0;
			for(int i=0;i<str.length();i++){
				temp = temp*10+(str[i]-'0');
			}
			cout<<numToStr[temp]<<endl; 
		}else{
			cout<<strToNum[str]<<endl;
		}
	}
	return 0;
}