1100 Mars Numbers （20 point(s)）

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。输入方面要判断输入类型，数字还是字母，是字母的话，还要判断输出的是一个单词还是两个单词。
2。转换要注意，13 26 39这样的低位为0的，只需要输出高位的火星文，低位不用输出。
3。一定注意字符别写错了！！ hel和hei 很像的！！ 太容易看错了.....

AC代码

#include <cstdio>
#include <map>
#include <string>
using namespace std;
char str1[5],str2[5];
char lower[13][5]={"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};
char higher[12][5]={"tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou"};
int read(int &a)
{
  int len=0,f=0;
  char c=getchar();
  if(c>='0'&&c<='9')
  {
    a=0;
    while(c>='0'&&c<='9')
    {
      a=a*10+c-'0';
      c=getchar();
    }
    return -1;
  }
  else
  {
    while(c!=' '&&c!='\n')
    {
      str1[len++]=c;
      c=getchar();
    }
    str1[len]='\0';
    if(c==' ')
    {
      c=getchar();
      len=0;
      f=1;
    }
    while(c!='\n')
    {
      str2[len++]=c;
      c=getchar();
    }
    str2[len]='\0';
  }
  return f;
}

int main()
{
  map<string,int> mp;
  for(int i=0;i<=12;++i)
    mp[lower[i]]=i;
  for(int i=1;i<=12;++i)
    mp[higher[i-1]]=i*13;
  int num,n;
  scanf("%d",&n);
  getchar();
  for(int i=0;i<n;++i)
  {
    int f=read(num);
    if(f==-1)
    {
      if(num<13)
        printf("%s\n",lower[num]);
      else if(num%13==0)
        printf("%s\n",higher[num/13-1]);
      else
        printf("%s %s\n",higher[num/13-1],lower[num%13]);
    }
    else if(f==0)
      printf("%d\n",mp[str1]);
    else
      printf("%d\n",mp[str1]+mp[str2]);
  }
  return 0;
}