ACM 1008

/*Description

During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long year, called Haab, which had 19 months. Each of the first 18 months was 20 days long, and the names of the months were pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin, muan, pax, koyab, cumhu. Instead of having names, the days of the months were denoted by numbers starting from 0 to 19. The last month of Haab was called uayet and had 5 days denoted by numbers 0, 1, 2, 3, 4. The Maya believed that this month was unlucky, the court of justice was not in session, the trade stopped, people did not even sweep the floor.

For religious purposes, the Maya used another calendar in which the year was called Tzolkin (holly year). The year was divided into thirteen periods, each 20 days long. Each day was denoted by a pair consisting of a number and the name of the day. They used 20 names: imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau and 13 numbers; both in cycles.

Notice that each day has an unambiguous description. For example, at the beginning of the year the days were described as follows:

1 imix, 2 ik, 3 akbal, 4 kan, 5 chicchan, 6 cimi, 7 manik, 8 lamat, 9 muluk, 10 ok, 11 chuen, 12 eb, 13 ben, 1 ix, 2 mem, 3 cib, 4 caban, 5 eznab, 6 canac, 7 ahau, and again in the next period 8 imix, 9 ik, 10 akbal . . .

Years (both Haab and Tzolkin) were denoted by numbers 0, 1, : : : , where the number 0 was the beginning of the world. Thus, the first day was:

Haab: 0. pop 0

Tzolkin: 1 imix 0
Help professor M. A. Ya and write a program for him to convert the dates from the Haab calendar to the Tzolkin calendar.
Input

The date in Haab is given in the following format:
NumberOfTheDay. Month Year

The first line of the input file contains the number of the input dates in the file. The next n lines contain n dates in the Haab calendar format, each in separate line. The year is smaller then 5000.
Output

The date in Tzolkin should be in the following format:
Number NameOfTheDay Year

The first line of the output file contains the number of the output dates. In the next n lines, there are dates in the Tzolkin calendar format, in the order corresponding to the input dates.
Sample Input

3
10. zac 0
0. pop 0
10. zac 1995
Sample Output

3
3 chuen 0
1 imix 0
9 cimi 2801
上周末，M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有365天的叫做Haab的历法。
这个Haab历法拥有19个月，在开始的18个月，一个月有20天，月份的名字分别是pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin,
muan, pax, koyab, cumhu。这些月份中的日期用0到19表示。Haab历的最后一个月叫做uayet，它只有5天，用0到4表示。玛雅人认为这个日期最少的月份是不吉利的，
在这个月法庭不开庭，人们不从事交易，甚至没有人打扫屋中的地板。

因为宗教的原因，玛雅人还使用了另一个历法，在这个历法中年被称为Tzolkin(holly年)，一年被分成13个不同的时期，每个时期有20天，
每一天用一个数字和一个单词相组合的形式来表示。使用的数字是1~13，使用的单词共有20个，
它们分别是：imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau。
注意：年中的每一天都有着明确唯一的描述，比如，在一年的开始，日期如下描述： 1 imix, 2 ik, 3 akbal, 4 kan, 5 chicchan, 6 cimi, 7 manik, 8 lamat,
 9 muluk, 10 ok, 11 chuen, 12 eb, 13 ben, 1 ix, 2 mem, 3 cib, 4 caban, 5 eznab, 6 canac, 7 ahau, ，8 imix, 9 ik, 10 akbal ……也就是说数字和单词各自独立循环使用。

Haab历和Tzolkin历中的年都用数字0，1，……表示，数字0表示世界的开始。所以第一天被表示成：
Haab: 0. pop 0
Tzolkin: 1 imix 0
请帮助M.A. Ya教授写一个程序可以把Haab历转化成Tzolkin历。
Input

Haab历中的数据由如下的方式表示：
日期. 月份 年数

输入中的第一行表示要转化的Haab历日期的数据量。下面的每一行表示一个日期，年数小于5000。
Output

Tzolkin历中的数据由如下的方式表示：
天数字 天名称 年数

第一行表示输出的日期数量。下面的每一行表示一个输入数据中对应的Tzolkin历中的日期。*/
#include<iostream> 
using namespace std; 
 
/*得到Haab历月份对应的数字*/ 
int GetMonth(char* month) 
{ 
    int ASCII=0; 
    for(int i=0;month[i];i++) 
        ASCII+=month[i]; 
 
    switch(ASCII) 
    { 
        case 335:return 1;  //pop 
        case 221:return 2;  //no 
        case 339:return 3;  //zip 
        case 471:return 4;  //zotz 
        case 438:return 5;  //tzec 
        case 345:return 6;  //xul 
        case 674:return 7;  //yoxkin 
        case 328:return 8;  //mol 
        case 414:return 9;  //chen 
        case 338:return 10;  //yax 
        case 318:return 11;  //zac 
        case 304:return 12;  //ceh 
        case 305:return 13;  //mac 
        case 636:return 14;  //kankin 
        case 433:return 15;  //muan 
        case 329:return 16;  //pax 
        case 534:return 17;  //koyab 
        case 546:return 18;  //cumhu 
        case 552:return 19;  //uayet 
    } 
} 
/*计算Haab历从第0天到现在的天数*/ 
int HaabDay(int day,int month,int year) 
{ 
    int sumday=0; 
    for(int i=0;i<year;i++) //Haab历法一年有365天 
        sumday+=365; 
 
    for(int j=1;j<month;j++) 
        sumday+=20; 
 
    return sumday+day; 
} 
 
int main(void) 
{ 
    char TzolkinDayName_Str[21][10]={"0","imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; 
    int day; 
    char doc;  //注意输入格式有 "." 
    char month[10]; 
    int year; 
 
    int test; 
    cin>>test; 
    cout<<test<<endl; 
    while(test-- && (cin>>day>>doc>>month>>year))  //日期. 月份 年数 
    { 
        int sumday=HaabDay(day,GetMonth(month),year); 
 
        int TzolkinYear=sumday/260;   //Tzolkin历法一年有260天 
        int TzolkinDayName=sumday%20+1; 
        int TzolkinDayId=sumday%13+1; 
 
        cout<<TzolkinDayId<<' '<<TzolkinDayName_Str[TzolkinDayName]<<' '<<TzolkinYear<<endl; 
    } 
    return 0; 
}