PAT(A) 1100

最新推荐文章于 2024-04-24 11:12:29 发布

K_HOLMES_

最新推荐文章于 2024-04-24 11:12:29 发布

阅读量295

点赞数

分类专栏： PAT(A) 文章标签： PAT A

本文链接：https://blog.youkuaiyun.com/K_HOLMES_/article/details/53423768

版权

PAT(A) 专栏收录该内容

6 篇文章

订阅专栏

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进制的转换，给数字输出对应的英文，给英文输出对应的数字。用map 和 string 进行处理就好。

#include
   
   
    
    
#include
    
    
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
         #include 
        
          using namespace std; int main(){ int n; string A[13]={"0","jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov", "dec"}; string B[13]={"0","tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer", "jou"}; map 
         
           a; map 
          
            b; map 
           
             a1; map 
            
              b1; for(int i=1;i<=12;i++){ a.insert(make_pair(A[i],i)); a1.insert(make_pair(i,A[i])); } for(int i=1;i<=12;i++){ b.insert(make_pair(B[i],i*13)); b1.insert(make_pair(i,B[i])); } string c; cin>>n; getchar(); int index=0; for(int i=1;i<=n;i++){ getline(cin,c); if(c[0]>='a'){ if(c.find(' ',0)!=c.npos||b[c]>=13){ string c1 = c.substr(0,c.find(' '));//c1 record the higher one string c2 = c.substr(c.find(' ')+1,c.size()); int ans = b[c1]+a[c2]; cout< 
             
               < 
              
                =13){ int ans = number/13; cout<