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. 

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. 

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. 

310. zac 00. pop 010. zac 1995

33 chuen 01 imix 09 cimi 2801

解题思路：首先将输入进来的 Haab日期换算成天数，除以Tzolkin日历的一年260天，就可以得到年份，用总天数对260和13取余，可以得到number，用总天数对260和20取余得到NameOfTheDay。因为Haab日期一年有365天，有19个月，前8个月有20天，第19个月只有5天。

Tzolkin日期的一年只有260天，要输出的格式为Number NameOfTheDay Year其中的number以13为周期循环，NameOfTheDay以shuimix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau为周期。

AC代码：

#include 
    
     #include
     
      #include
      
       using namespace std;int n;int day,year,sum,day1,year1,month1;char month[10];char haab[19][19]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};char Tzolkin[20][20]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};int judge(char s[]){    for(int i=0;i<19;i++)    {        if(strcmp(haab[i],s)==0)        return i;    }    return 0;}int main(){    scanf("%d",&n);    printf("%d\n",n);    while(n--)    {        scanf("%d. %s %d",&day,month,&year);        sum=year*365+judge(month)*20+day;        year1=sum/260;        month1=sum%260%20;        day1=sum%260%13;        printf("%d %s %d\n",day1+1,Tzolkin[month1],year1);//day+1是因为
       Tzolkin日历的number是以1开始的。    }    return 0;}