hdu 1444 Maya Calendar

题目地址：

http://acm.hdu.edu.cn/showproblem.php?pid=1444

题目描述：

Maya Calendar

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 492    Accepted Submission(s): 212

Problem 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. 

题意：

日历转换。

题解：

这里 一定要注意整年的情况比如总天数就是260天，那么我们输出tzolkin 日历应该是0年的最后一天，而不应该是1年的第一天。

代码:

#include<stdio.h>
#include<map>
#include<string>
#include<iostream>
using namespace std;
int t=0;
int sum_day=0;
map<string,int> haab_map;
map<int,string> tzolkin_map;
char buf[100];
int init_map()
{
    haab_map["pop"]=1;//month begin with 1
    haab_map["no"]=2;
    haab_map["zip"]=3;
    haab_map["zotz"]=4;
    haab_map["tzec"]=5;
    haab_map["xul"]=6;
    haab_map["yoxkin"]=7;
    haab_map["mol"]=8;
    haab_map["chen"]=9;
    haab_map["yax"]=10;
    haab_map["zac"]=11;
    haab_map["ceh"]=12;
    haab_map["mac"]=13;
    haab_map["kankin"]=14;
    haab_map["muan"]=15;
    haab_map["pax"]=16;
    haab_map["koyab"]=17;
    haab_map["cumhu"]=18;
    haab_map["uayet"]=19;
    tzolkin_map[0]="ahau";
    tzolkin_map[1]="imix"; //day begin with 1 number is from 1 to 13 cycle  name is 1 to 20 cycle
    tzolkin_map[2]="ik";
    tzolkin_map[3]="akbal";
    tzolkin_map[4]="kan";
    tzolkin_map[5]="chicchan";
    tzolkin_map[6]="cimi";
    tzolkin_map[7]="manik";
    tzolkin_map[8]="lamat";
    tzolkin_map[9]="muluk";
    tzolkin_map[10]="ok";
    tzolkin_map[11]="chuen";
    tzolkin_map[12]="eb";
    tzolkin_map[13]="ben";
    tzolkin_map[14]="ix";
    tzolkin_map[15]="mem";
    tzolkin_map[16]="cib";
    tzolkin_map[17]="caban";
    tzolkin_map[18]="eznab";
    tzolkin_map[19]="canac";
    tzolkin_map[20]="ahau";
    return(0);
}
int main()
{
    init_map();
    scanf("%d",&t);
    printf("%d\n",t);
    while(t--)
    {
        int haab_day=0,haab_year=0,tzolkin_num,tzolkin_year;
        string haab_month;
        string tzolkin_name;
        scanf("%d.%s%d",&haab_day,buf,&haab_year);
        haab_month = buf;
        sum_day=(haab_year*365) + (haab_map[haab_month] - 1) * 20 + (haab_day + 1);
        tzolkin_year = sum_day / 260;
        if(sum_day % 260 == 0) tzolkin_year--;
        tzolkin_name = tzolkin_map[sum_day % 20];
        tzolkin_num = sum_day % 13;
        if(tzolkin_num == 0) tzolkin_num = 13;
        printf("%d %s %d\n",tzolkin_num, tzolkin_name.c_str(), tzolkin_year);
    }
    return(0);
}