北大ACM訓練題（1008——Maya Calendar）

題目鏈接：

先求出給出的日期從世界開始是第幾天，再轉換爲holly日曆就行了，注意天數能被260整除的情況，是上一年的最後最後一天，不是新的一年的第一天，因爲haab日曆是從0~19，所以注意轉換的時候日期還要加1，爲了避免麻煩的判斷，haab歷從數組0元素開始儲存，holly日曆也從0開始存，這樣就不用再去判斷是月初第一天還是月末最後一天。

然後巨坑的是！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！

輸出例子的數目的時候要把這個數打印出來，wa了一晚上！！！！！！！！！！！！！！！！！！！！！！！！！！

AC代碼

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