POJ1008 UVA300 UVALive5515 Maya Calendar日期计算

Posted tigerisland45

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了POJ1008 UVA300 UVALive5515 Maya Calendar日期计算相关的知识,希望对你有一定的参考价值。

Maya Calendar
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 83979 Accepted: 25793

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

  1. zac 0
  2. pop 0
  3. zac 1995

Sample Output

3
3 chuen 0
1 imix 0
9 cimi 2801

Source

Central Europe 1995

Regionals 1995 >> Europe - Central

问题链接POJ1008 UVA300 UVALive5515 Maya Calendar
问题简述:(略)
问题分析
????这是一个日历计算问题,只能算是一个水题。程序逻辑上要处理得简洁才是关键。
程序说明:(略)
参考链接:(略)
题记:(略)

AC的C语言程序如下:

/* POJ1008 UVA300 UVALive5515 Maya Calendar */

#include <stdio.h>
#include <string.h>

#define N 10

char *Haab[] = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax"
         , "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"};
char *Tzolkin[] = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk"
         , "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"};
char month[N];

int main(void)
{
    int n, day, year, i;
    scanf("%d", &n);
    printf("%d
", n);
    while(n--) {
        scanf("%d. %s %d", &day, month, &year);     /* 读入Haab历的年月日 */
        for(i = 0; i < 19; i++)
            if(!strcmp(month, Haab[i]))
                break;
        int days = year * 365 + i * 20 + day;
        printf("%d %s %d
", 1 + days % 13, Tzolkin[days % 20], days / 260);
    }

    return 0;
}

以上是关于POJ1008 UVA300 UVALive5515 Maya Calendar日期计算的主要内容,如果未能解决你的问题,请参考以下文章

POJ1598 ZOJ1315 HDU1606 UVA409 UVALive5493 Excuses, Excuses!文本

POJ1573 ZOJ1708 UVA10116 UVALive5334 HDU1035 Robot MotionDFS+BFS

poj1639,uva1537,uvalive2099,scu1622,fzu1761 Picnic Planning (最小限制生成树)

SPOJ-BEADS UVA719 UVALive5545 POJ1509 ZOJ2006 Glass Beads字符串环的最小

UVA && UVALive 开荒

UVaLive4043 UVa1411 Ants 巨人与鬼