1001 Hello,World!

題目如下：

This is the first problem for test.

Since all we know the ASCII code, your job is simple: Input numbers and output corresponding messages.

Input

The input will contain a list of positive integers separated by whitespaces(spaces, newlines, TABs). Please process to the end of file (EOF). The integers will be no less than 32.

Output

Output the corresponding message. Note there is NOT a newline character in the end of output.

Sample Input

72 101 108 108 111 44 32 119 111 114 108 100 33

Sample Output

Hello, world!

解題思路：

輸入int型別數字，強制轉換為char型別，然後輸出。

AC程式碼

#include <iostream>
using namespace std;
int main()
{
    int
 
 n;
    while(cin >> n)
    {
        cout << (char)n;
    }
}

1002 Maya Calendar

題目如下：

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 contains the number of the input dates in the input. 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 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

解題思路：

• 本題是根據所輸入Haab的年、月的名稱、天，輸出Tzolkin的年、天的名稱以及對應的數字
• 首先要根據輸入的Haab月的名稱找到對應的月份數字
• 然後用公式：days = Haab年*365+（月份數字 - 1）*20+天，算出公有多少天
• 用days/260算出對應的Tzolkin的年
• 用moddays = days%260算出對應的Tzolkin算出餘數天
• 用moddays%20算出是第幾天，對應出天的名稱
• 用moddays%13+1算出天對應的數字

AC程式碼：

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

string monthhaab [19] = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"};

string nameofthedaytzolkin [20] = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik","lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem","cib", "caban", "eznab", "canac", "ahau"};

//取得輸入的monthhaab對應的數值
int getmonthhaab(string Month)
{
    string m(Month);
    for(int j = 0;j < 19; j++)
    {
        if(m == monthhaab[j]) return j;
    }
}

int main()
{
    int n;
    cin >> n;
    int NumberOfTheDay;
    char ch;
    string Month;
    int YearHaab;

    cout << n <<endl;

    while(n--)
    {
        cin >> NumberOfTheDay >> ch >> Month >> YearHaab;
        int days = YearHaab * 365 + getmonthhaab(Month) * 20
                   + NumberOfTheDay;
        int YearTzolkin = days / 260;
        int modyeartzolkin = days % 260;
        int numnameofthedaytzoklin = modyeartzolkin % 20;
        int Number = modyeartzolkin % 13 +1;
        cout << Number << " " <<                           
                nameofthedaytzolkin[numnameofthedaytzoklin]
                << " " << YearTzolkin << endl;
    }
    return 0;
}