poj解题报告——1008

最新推荐文章于 2022-09-03 14:22:29 发布

原创最新推荐文章于 2022-09-03 14:22:29 发布 · 450 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c #poj #模拟

poj 专栏收录该内容

130 篇文章

订阅专栏

本文介绍了一种使用C语言实现的玛雅历法日期转换算法。通过输入现代日期，程序将其转换为玛雅长计历对应的日期形式，涉及字符串处理、条件判断等基本编程技巧。

这个玛雅历呀，难是不难，就是看着眼花，历法题就是这样，在数学计算的基础上加文字坑人。其实这题就是算模拟，算是放松放松心情吧。

代码如下

#include<stdio.h>

#include<string.h>
char H[20][10]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
char T[22][10]={"ahau","imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac"};
void main()
{
   int d, y, n, i;
   char m[20];
   scanf("%d", &n);
   printf("%d\n", n);
   while(n--)
   {
       scanf("%d. %s %d",&d,m,&y);
       for (i = 0; i < 19; i++)
       {
           if(strcmp(m,H[i])==0)
               break;
       }
       d+=i*20+y*365;
       printf("%d %s %d\n",d%13+1,T[(d+1)%20],d/260);
   }
}