北大oj1008——Maya Calendar

Maya Calendar

Time Limit: 1000MS Memory Limit: 10000K

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
11. pop 0
12. zac 1995

Sample Output

3
3 chuen 0
1 imix 0
9 cimi 2801

这道题有两个坑点：
1.注意第365天的时候，并不是新的一年，而是一年中的最后一天！
2.审题不仔细，在输出的时候需要先输出n;

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
using namespace std;

int main()
{
    map<string, int> Haab_month_T;
    string Haab_str[20] = {
        "pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"
    };
    for (int i = 0; i < 20; i++) {
        Haab_month_T[Haab_str[i]] = i;
    }

    map<int, string> Tzolkin_month;
    string Tzolkin_str[20] = {
         "imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"
    };
    for (int i = 0; i < 20; i++) {
        Tzolkin_month[i] = Tzolkin_str[i];
    }

    int n;
    cin >> n;
    cout << n << endl;
    for (int i = 0; i < n; i++) {
        char Haab_day[10];
        char Haab_month[10];
        char Haab_year[10];
        cin >> Haab_day >> Haab_month >> Haab_year;
        int day = 0;
        string month = "";
        int year = 0;
        for (int itStr = 0; Haab_day[itStr] != NULL; itStr++) {
            if (Haab_day[itStr] != '.') {
                day = day * 10 + Haab_day[itStr] - '0';
            }
        }
        for (int itStr = 0; Haab_year[itStr] != NULL; itStr++) {
            year = year * 10 + Haab_year[itStr] - '0';
        }
        int totalDay = year * 365 + Haab_month_T[Haab_month] * 20 + day + 1;

        int Tzolkin_day = (totalDay - 1) % 13 + 1;
        int Tzolkin_year = (totalDay - 1) / (13 * 20);
        int Tzolkin_month_int = (totalDay - 1 - Tzolkin_year * 13 * 20) % 20;
        if (totalDay == 0) {
            Tzolkin_year = 0;
            Tzolkin_month_int = 0;
        }
        string Tzolkin_month_str = Tzolkin_month[Tzolkin_month_int];

        cout << Tzolkin_day <<" "<< Tzolkin_month_str << " " << Tzolkin_year << endl;
    }

    return 0;
}