hdu1444 Maya Calendar

D - Maya Calendar

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu

Submit  Status

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




题目蛮简单，但是还是没有考虑周全，唉

注意：1.当总天数正好是260（或者是260的倍数）的时候，这个时候260/260=1，算出来的年数是1，但实际上是第一年的最后一天，年数数应该为0；
2.计算天数的时候，当sum_day%13==0时，应该是最后一天（即13日，而不是0日);
3.计算月数的时候，也会出现跟上面一样的情况，所以我把最后一个月拿到第一个了

网上一种题解：先不要把最后那一天加上，等到最后算月数和天数的时候再加上，这个是好方法

#include <stdio h=""> #include <stdlib h=""> #include <string h=""> char str[10]; char s[20][10]={"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"}; char s2[25][10]={"ahau","imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac"};//注意吧第20天的拿到第一个，这样20%20==0时输出第一个 int main() { int n,d,y,i; int sum_day; scanf("%d",&n); printf("%d\n",n); while(n--) { sum_day=0; scanf("%d. %s %d",&d,str,&y); for(i=0;i<19;i++) { if(strcmp(str,s[i])==0) { sum_day=y*365+i*20+d+1;//一定不要忘了加上年数 break; } } if(sum_day%260==0) y=sum_day/260-1; else y=sum_day/260; sum_day%=260; if(sum_day%13) d=sum_day%13; else d=13; printf("%d %s %d\n",d,s2[sum_day%20],y); } return 0; } </string></stdlib></stdio>