PAT——1044. 火星数字

 1 package com.hone.basical;
 2 
 3 import java.util.Scanner;
 4 
 5 /**
 6  * 听起来很复杂，其实也就是一个进制转化的问题。
 7  * 原题目：https://www.patest.cn/contests/pat-b-practise/1044
 8  * 这里面有一点需要注意比如   13  直接输出  tam  而不是tam tret(因为tam本身就代表13)
 9  * @author Xia
10  */
11 public class basicalLevel1044MarsWords {
12 
13     public static void main(String[] args) {
14         String[] gewei = { "tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec" };
15         String[] jinwei = { "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou" };
16         Scanner in = new Scanner(System.in);
17         int n = Integer.parseInt(in.nextLine());
18 
19         for (int i = 0; i < n; i++) {
20             String num = in.nextLine();
21             if (num.charAt(0) <= ‘9‘ && num.charAt(0) >= ‘0‘) {
22                 int numN = Integer.parseInt(num);
23                 if (numN / 13 > 0) {
24                     if (numN%13 == 0) {
25                         System.out.println(jinwei[numN/13-1]);
26                     }else {
27                         System.out.println(jinwei[numN / 13 - 1] + " " + gewei[numN % 13]);
28                     }
29                 } else {
30                     System.out.println(gewei[numN]);
31                 }
32             } else {
33                 int numa = 0;
34                 String[] numS = num.split(" ");
35                 int k = numS.length - 1;
36                 while (k >= 0) {
37                     int a = 1;
38                     for (int j = 0; j < gewei.length&&(k>=0); j++) {
39                         if (numS[k].equals(gewei[j])) {
40                             numa = j;
41                             k--;
42                             break;
43                         }
44                     }
45                     for (int j = 0; j < jinwei.length&&(k>=0); j++) {
46                         if (numS[k].equals(jinwei[j])) {
47                             numa += (j + 1) * Math.pow(13.0, a++);
48                             k--;
49                             break;
50                         }
51                     }
52                     System.out.println(numa);
53                 }
54             }
55         }
56     }
57 
58 }