POJ 1008 Maya Calendar

最新推荐文章于 2019-07-09 22:29:40 发布

原创最新推荐文章于 2019-07-09 22:29:40 发布 · 361 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#calendar

本文介绍了一种特殊的历法转换算法，通过计算两种不同历法之间的对应关系，实现了从一种历法到另一种历法的日期转换。具体步骤包括将第一种历法的日期转化为天数，进而计算出第二种历法的年数、该年的天数以及具体的日期。

恶心的历法

首先算出第一种历法的日期转化成天数d（少计1天），第二种历法的年数即为d/260，再让d对260取余，就得到这一年有多少天，再d对20取余，就得到第几天，然后d对13取余再加1，得到阶段数

d少计一天，方便下面求month，例如本来day为21，现在记为20，month=0，正好与imix对应

否则取余结果为1，与ik对应

如果不少计一天，当取余结果为0时，结果应该为ahau，现在少计一天后，原来取余结果为1-19的各减一，与数组下标对应，取余结果为0的变为19，与最后一天刚好对应

代码：

#include<iostream> #include<string> using namespace std; char m1[20][10]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"}; char m2[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; int main() { int i,j,ca,hday,hyear,tday,tyear,month,day,year; char hmonth[20]; scanf("%d",&ca); printf("%d/n",ca); while(ca--) { scanf("%d%",&hday); getchar(); scanf("%s",&hmonth); scanf("%d",&hyear); for(i=0;i<19;i++) { if(strcmp(hmonth,m1[i])==0) { month=i; break; } } day=hyear*365+month*20+hday;// //cout<<day<<endl; year=day/260; day%=260; //cout<<day<<endl; month=day%20; day%=13; day++; //cout<<month<<endl; printf("%d %s %d/n",day,m2[month],year); } return 0; }