1100. Mars Numbers

最新推荐文章于 2023-02-02 12:51:59 发布

sky247391475

最新推荐文章于 2023-02-02 12:51:59 发布

阅读量331

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT 文章标签： PAT C++

本文链接：https://blog.youkuaiyun.com/sky247391475/article/details/52673252

PAT 专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一个程序，用于实现地球十进制数与火星十三进制数之间的相互转换。火星计数系统使用独特的命名方式，从0到12对应特定的火星词汇，更高的位数也有相应的词汇表示。通过解析输入，程序能够准确地将数值从一种计数系统转换为另一种。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1100. Mars Numbers (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

People on Mars count their numbers with base 13:

Zero on Earth is called "tret" on Mars.
The numbers 1 to 12 on Earch 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

最多是个两位数，按照进制转换的步骤模拟一下，当数是13的整数倍时，输出一位即可。

#include <iostream>   
#include<algorithm>  
#include<string>  

using namespace std;  

string 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" };  

string earth2mar(string s)
{
	string ans;
	int earth=0;
	for(int i=0;i<s.size();++i)
		earth=s[i]-'0'+earth*10;
	if(earth%13||earth==0)
	{
		if(earth<13)
			ans+=mars[earth];
		else
		{
			ans+=mars[earth/13+12]+' '+mars[earth%13];
		}
	}
	else
		ans+=mars[earth/13+12];

	return ans;
}
int mar2earth(string s)
{
	int ans=0;
	int idx;
	idx=s.find(' ');
	if(idx==string::npos)
	{
		for(int i=0;i<13;++i)
			if(s==mars[i])
				ans=i;
		for(int i=13;i<25;++i)
			if(s==mars[i])
				ans=(i-12)*13;	
	}
	else
	{
		string sh=s.substr(0,idx);
		string sl=s.substr(idx+1,s.size()-idx);
		for(int i=13;i<25;++i)
			if(sh==mars[i])
				ans=i-12;	
		for(int i=0;i<13;++i)
			if(sl==mars[i])
				ans=i+ans*13;	
	}

	return ans;

}

int main()
{
	int n;
	cin>>n;
	getchar();
	for(int i=0;i<n;++i)
	{
		string s;
		getline(cin,s);
		if(s[0]>='0'&&s[0]<='9')
			cout<<earth2mar(s)<<endl;
		else
			cout<<mar2earth(s)<<endl;
	}
	return 0;
}