[POJ 1008] Maya Calendar C++解题
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 62297 | Accepted: 19221 |
Description
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
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
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
翻译:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 62297 | Accepted: 19221 |
Description
因为宗教的原因,玛雅人还使用了另一个历法,在这个历法中年被称为Tzolkin(holly年),一年被分成13个不同的时期,每个时期有20天,每一 天用一个数字和一个单词相组合的形式来表示。使用的数字是1~13,使用的单词共有20个,它们分别是:imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau。注意:年中的每一天都有着明确唯一的描述,比如,在一年的开始,日期如下描述: 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, ,8 imix, 9 ik, 10 akbal ……也就是说数字和单词各自独立循环使用。
Haab历和Tzolkin历中的年都用数字0,1,……表示,数字0表示世界的开始。所以第一天被表示成:
Haab: 0. pop 0
Tzolkin: 1 imix 0
请帮助M.A. Ya教授写一个程序可以把Haab历转化成Tzolkin历。
Input
日期. 月份 年数
输入中的第一行表示要转化的Haab历日期的数据量。下面的每一行表示一个日期,年数小于5000。
Output
天数字 天名称 年数
第一行表示输出的日期数量。下面的每一行表示一个输入数据中对应的Tzolkin历中的日期。
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日期。
源码
1 /* 2 poj 1000 3 version:1.0 4 author:Knight 5 Email:[email protected] 6 */ 7 8 #include <cstdio> 9 #include <cstring> 10 using namespace std; 11 struct _stru_HaabDate_ 12 { 13 int NumberOfTheDay; 14 char MonthName[10]; 15 int MonthIndex; 16 int Year; 17 }; 18 struct _stru_TzolkinDate_ 19 { 20 int Number; 21 char NameOfTheDay[10]; 22 int Year; 23 }; 24 char HAABMONTHNAME[19][10] = { "pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen",25 "yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet" 26 }; 27 char TZOLKINDAYNAME[20][10] = {"imix", "ik","akbal","kan","chicchan","cimi","manik",28 "lamat","muluk","ok", "chuen","eb", "ben","ix","mem","cib","caban","eznab","canac","ahau" 29 }; 30 //返回HaabDate日期距离世界开始的天数 31 int CountDaysToWorldBegin(_stru_HaabDate_ HaabDate); 32 //通过已知的距离世界开始的天数,转换某Tzolkin的日期 33 _stru_TzolkinDate_ CovertToTzolkin(int DaysToWorldBegin); 34 int main(void) 35 { 36 int CaseNum; 37 int i; 38 _stru_HaabDate_ HaabDate; 39 _stru_TzolkinDate_ TzolkinDate; 40 int DaysToWorldBegin; 41 //获得用户输入 42 scanf("%d", &CaseNum); 43 printf("%d\n", CaseNum); 44 for (i=0; i<CaseNum; i++) 45 { 46 scanf("%d.%s%d", &HaabDate.NumberOfTheDay, HaabDate.MonthName, &HaabDate.Year); 47 //printf("%d %s %d\n", HaabDate.NumberOfTheDay, HaabDate.MonthName, HaabDate.Year); 48 //计算Haab日期距离世界开始的天数 49 DaysToWorldBegin = CountDaysToWorldBegin(HaabDate); 50 //转换成Tzolkin日期 51 TzolkinDate = CovertToTzolkin(DaysToWorldBegin); 52 printf("%d %s %d\n", TzolkinDate.Number, TzolkinDate.NameOfTheDay, TzolkinDate.Year); 53 } 54 return 0; 55 } 56 //返回HaabDate日期距离世界开始的天数 57 int CountDaysToWorldBegin(_stru_HaabDate_ HaabDate) 58 { 59 int i; 60 int Result; 61 //计算HaabDate日期是该年的第几个月,从0开始计数 62 for (i=0; i<19; i++) 63 { 64 if (strcmp(HaabDate.MonthName, HAABMONTHNAME[i]) == 0) 65 { 66 HaabDate.MonthIndex = i; 67 break; 68 } 69 } 70 Result = 365 * HaabDate.Year + 20 * HaabDate.MonthIndex + HaabDate.NumberOfTheDay; 71 return Result; 72 } 73 //通过已知的距离世界开始的天数,转换某Tzolkin的日期 74 _stru_TzolkinDate_ CovertToTzolkin(int DaysToWorldBegin) 75 { 76 _stru_TzolkinDate_ TzolkinDate; 77 TzolkinDate.Number = DaysToWorldBegin % 13 + 1; 78 int DayNameIndex = DaysToWorldBegin % 20; 79 strcpy(TzolkinDate.NameOfTheDay, TZOLKINDAYNAME[DayNameIndex]); 80 TzolkinDate.Year = DaysToWorldBegin / 260; 81 return TzolkinDate; 82 }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。