1044. 火星數(shù)字(20)

2019-11-11 07:53:58

字體：大中小

供稿：網(wǎng)友

火星人是以13進(jìn)制計數(shù)的：

地球人的0被火星人稱為tret。地球人數(shù)字1到12的火星文分別為：jan, feb, mar, aPR, may, jun, jly, aug, sep, oct, nov, dec。火星人將進(jìn)位以后的12個高位數(shù)字分別稱為：tam, hel, maa, huh, tou, kes, hei, elo, syy, lok, mer, jou。例如地球人的數(shù)字“29”翻譯成火星文就是“hel mar”；而火星文“elo nov”對應(yīng)地球數(shù)字“115”。為了方便交流，請你編寫程序?qū)崿F(xiàn)地球和火星數(shù)字之間的互譯。

輸入格式：

輸入第一行給出一個正整數(shù)N（<100），隨后N行，每行給出一個[0, 169)區(qū)間內(nèi)的數(shù)字 —— 或者是地球文，或者是火星文。

輸出格式：

對應(yīng)輸入的每一行，在一行中輸出翻譯后的另一種語言的數(shù)字。

輸入樣例： 4 29 5 elo nov tam 輸出樣例： hel mar may 115 13

#include <iostream>#include <string>#include <stdio.h> #include <cstring>using namespace std;string gewei[13] = {"tret","jan","feb","mar","apr","may","jun","jly","aug","sep","oct","nov","dec"};string shiwei[13] ={" ","tam","hel","maa","huh","tou","kes","hei","elo","syy","lok","mer","jou"};int Number(string str){ int sum = 0; for ( int i = 0 ; i < str.length() ; i++){ sum = sum * 10 + (str[i] -'0'); } return sum;}void Exchange_Mars(string str){ int num = Number(str); int a = num / 13; int b = num % 13; if ( shiwei[a] != " "){ cout<<shiwei[a]<<" "; } cout<<gewei[b]<<endl;}int Search(string str[] ,int n,string tmp){ int index = -1; for ( int i = 0 ; i < n ; i++){ if ( tmp == str[i]){ index= i; break; } } return index;}void Exchange_Earth(string str){ int len = str.length(); int i; int flag = 0; for ( i = 0 ; i < len ; i++){ if (str[i] == ' '){ flag = 1; break; } } string str1 ,str2; if ( flag == 1){ str1 = str.substr(0,i); str2 = str.substr(i+1,len-i-1); int a = Search(shiwei,13,str1); int b = Search(gewei,13,str2); int sum; if ( a != -1 && b != -1) sum = a * 13 + b; cout<<sum<<endl; }else{ int a = Search(shiwei,13,str); int b = Search(gewei,13,str); if ( a != -1 || b != -1){ if ( a != -1){ cout<<a*13<<endl; } if ( b != -1){ cout<<b<<endl; } } }}void Exchange(string str){ if ( str[0] >= '0' && str[0] <= '9'){ Exchange_Mars(str); }else{ Exchange_Earth(str); }}int main(){ int num; cin>>num; string str[num]; char string[10]; gets(string); str[0].append(string,strlen(string)); Exchange(str[0]); for ( int i = 0 ; i < num ; i++){ gets(string); str[i].append(string,strlen(string)); Exchange(str[i]); } return 0;}

（PS:bug找不出來了） 這里寫圖片描述