[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日期。
源码
/*
poj 1000
version:1.0
author:Knight
Email:S.Knight.Work@gmail.com
*/ #include <cstdio>
#include <cstring>
using namespace std;
struct _stru_HaabDate_
{
int NumberOfTheDay;
char MonthName[];
int MonthIndex;
int Year;
};
struct _stru_TzolkinDate_
{
int Number;
char NameOfTheDay[];
int Year;
};
char HAABMONTHNAME[][] = { "pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen",\
"yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"
};
char TZOLKINDAYNAME[][] = {"imix", "ik","akbal","kan","chicchan","cimi","manik",\
"lamat","muluk","ok", "chuen","eb", "ben","ix","mem","cib","caban","eznab","canac","ahau"
};
//返回HaabDate日期距离世界开始的天数
int CountDaysToWorldBegin(_stru_HaabDate_ HaabDate);
//通过已知的距离世界开始的天数,转换某Tzolkin的日期
_stru_TzolkinDate_ CovertToTzolkin(int DaysToWorldBegin);
int main(void)
{
int CaseNum;
int i;
_stru_HaabDate_ HaabDate;
_stru_TzolkinDate_ TzolkinDate;
int DaysToWorldBegin;
//获得用户输入
scanf("%d", &CaseNum);
printf("%d\n", CaseNum);
for (i=; i<CaseNum; i++)
{
scanf("%d.%s%d", &HaabDate.NumberOfTheDay, HaabDate.MonthName, &HaabDate.Year);
//printf("%d %s %d\n", HaabDate.NumberOfTheDay, HaabDate.MonthName, HaabDate.Year);
//计算Haab日期距离世界开始的天数
DaysToWorldBegin = CountDaysToWorldBegin(HaabDate);
//转换成Tzolkin日期
TzolkinDate = CovertToTzolkin(DaysToWorldBegin);
printf("%d %s %d\n", TzolkinDate.Number, TzolkinDate.NameOfTheDay, TzolkinDate.Year);
}
return ;
}
//返回HaabDate日期距离世界开始的天数
int CountDaysToWorldBegin(_stru_HaabDate_ HaabDate)
{
int i;
int Result;
//计算HaabDate日期是该年的第几个月,从0开始计数
for (i=; i<; i++)
{
if (strcmp(HaabDate.MonthName, HAABMONTHNAME[i]) == )
{
HaabDate.MonthIndex = i;
break;
}
}
Result = * HaabDate.Year + * HaabDate.MonthIndex + HaabDate.NumberOfTheDay;
return Result;
}
//通过已知的距离世界开始的天数,转换某Tzolkin的日期
_stru_TzolkinDate_ CovertToTzolkin(int DaysToWorldBegin)
{
_stru_TzolkinDate_ TzolkinDate;
TzolkinDate.Number = DaysToWorldBegin % + ;
int DayNameIndex = DaysToWorldBegin % ;
strcpy(TzolkinDate.NameOfTheDay, TZOLKINDAYNAME[DayNameIndex]);
TzolkinDate.Year = DaysToWorldBegin / ;
return TzolkinDate;
}
[POJ 1008] Maya Calendar C++解题的更多相关文章
- poj 1008:Maya Calendar(模拟题,玛雅日历转换)
Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 64795 Accepted: 19978 D ...
- POJ 1008 Maya Calendar
链接:http://poj.org/problem?id=1008 Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Subm ...
- [POJ] #1008# Maya Calendar : 字符处理/同余问题
一. 题目 Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 74085 Accepted: 2 ...
- POJ 1008 Maya Calendar / UVA 300【日期转换/常量数组】
Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 82431 Accepted: 25319 Descr ...
- Poj OpenJudge 百练 Bailian 1008 Maya Calendar
1.Link: http://poj.org/problem?id=1008 http://bailian.openjudge.cn/practice/1008/ 2.content: Maya Ca ...
- 【POJ】1008 Maya Calendar
参考:https://blog.csdn.net/u011392408/article/details/28866779 https://blog.csdn.net/qq_36424540/artic ...
- Poj Maya Calendar
http://poj.org/problem?id=1008 Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissio ...
- Maya Calendar 分类: POJ 2015-06-11 21:44 12人阅读 评论(0) 收藏
Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 70016 Accepted: 21547 D ...
- POJ1008 Maya Calendar
题目来源:http://poj.org/problem?id=1008 题目大意: Maya人认为一年有365天,但他们有两种日历.一种叫做Haab,有19个月.前18个月每月20天,每个月的名字分别 ...
随机推荐
- 整合mybatis分页插件及通用接口测试出现问题
严重: Servlet.service() for servlet [springmvc] in context with path [/mavenprj] threw exception [Requ ...
- https的网站使用百度地图的问题
https的网站使用百度地图,如果你引用的地址没写对的话,加载不出来百度地图,被认为是不安全的JS内容. 引用的地址:http://api.map.baidu.com/api?v=2.0&ak ...
- static 关键字用法
static a=0; 就是把a初始化为0:初始值为0而已 即使a是局部变量,每次进入此变量所在的函数,a值还是保持上次赋值: 在中断里建议在局部变量前加上static,以确保此变量值的寿命
- Cordova for iOS
Cordova,对这个名字大家可能比较陌生,大家肯定听过 PhoneGap 这个名字,Cordova 就是 PhoneGap 被 Adobe 收购后所改的名字. Cordova 是一个可以让 JS 与 ...
- windows 10 无法使用内置管理员账户打开应用的解决方案
步骤 运行regedit.msc: 依次找到:HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\System\ ...
- AHK进阶之路
本文摘自 http://www.cnblogs.com/echorep/p/4911117.html 小鸟学AHK(1)之运行程序或打开文档 AHK就是AutoHotKey,是一款免费的.Wind ...
- 【UML】时序图Sequence diagram(交互图)(转)
前言 UML时序图是UML动态图之一,它是强调时间顺序的交互图. 定义 时序图是显示按时间顺序排列的对象之间交互的图. 组成元素 对象 包括三种命名 ...
- UVA 1611 Crane 起重机 (子问题)
题意:给一个1~n排列,1<=n<=10000,每次操作选取一个长度为偶数的连续区间.交换前一半和后一半,使它变成升序. 题解:每次只要把最小的移动到最左边,那么问题规模就缩小了.假设当前 ...
- keycode对应表
keycode对应表 keycode 8 = BackSpace 回格keycode 9 = Tab keycode 12 = Clearkeycode 13 = Enter 回车 ...
- if...else...这段代码打印结果,并简述其理由
var age = 20; if (age >= 6) { console.log('teenager'); } else if (age >= 18) { console.log('ad ...