发表文章

[最新] PAT-1100 Mars Numbers

eric4784510 26天前 1

版权声明:本文为博主原创文章,未经博主允许不得转载。 http://blog.csdn.net/eric4784510/article/details/82179966

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 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

    注意mars格式有两位时,若低位为零则不输出。

#include<stdio.h>
#include<iostream>
#include<string>
#include<sstream>
#include<map>
using namespace std;

char low[][5]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};
char heigh[][5]={"tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou"};
int string2int(string s){
	int i;
	stringstream st(s);
	st>>i;
	return i;
}
int main(){
	int n;
	scanf("%d",&n);

	map<string,int> marsl;
	map<string,int> marsh;
	marsl["tret"]=0;
	for(int i=0;i<12;i++){
		marsl[string(low[i+1])]=i+1;
		marsh[string(heigh[i])]=i+1;
	}
	getchar();
	for(int i=0;i<n;i++){
		char tmp[20];
		cin.getline(tmp,20);
		if(tmp[0]>='0'&&tmp[0]<='9'){
			int e=string2int(string(tmp));
			int h=e/13;
			int l=e%13;
			if(h>0)printf("%s",heigh[h-1]);
			if(h>0&&l!=0)printf(" ");
			if(h==0||l!=0)printf("%s\n",low[l]);
			else printf("\n");
		}else{
			string m(tmp),ml,mh;
			int j=m.find(' ');
			if(j!=m.npos){ 
				mh=m.substr(0,j);
				ml=m.substr(j+1);
			}else{
				ml=m;
			}
			int el,eh;
			if(mh.size()>0)eh=marsh[mh];
			else eh=0;

			if(marsl.find(ml)!=marsl.end())el=marsl[ml];
			else {el=0;eh=marsh[ml];}
	
			int e=eh*13+el;
			printf("%d\n",e);
		}
	}

	return 0;
}


 

相关推荐
最新评论 (0)
返回
发表文章
eric4784510
文章数
85
评论数
0
注册排名
973325