POJ-1008-Maya Calendar
http://poj.org/problem?id=1008
這道題主要涉及到求模運(yùn)算和字符串?dāng)?shù)組。
需要考慮的細(xì)節(jié)是，求模的結(jié)果是否能夠取0或者最大值。
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main()
{
int i, j, n, num, day;
scanf("%d", &n);
char *Haab[19]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
char *tzol[20]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
char month[10];
char tmp;
int year, m, total, tzoyear, tzomonth, tzoday;
printf("%d\n", n);
for(i=0;i<n;i++)
{
scanf("%d %c %s %d", &num, &tmp, month, &year);
for(j=0;j<19;j++)
{
if(!strcmp(month, Haab[j]))
{
m=j;
j=19;
}
}
total=year*365+m*20+num;
tzoyear=total/260;
tzoday=total%260;
tzomonth=tzoday%20;
tzoday=tzoday%13+1;
printf("%d %s %d\n", tzoday, tzol[tzomonth], tzoyear);
}
return 0;
}
