暴力打表,但有个地方要注意一下,每个tzolkin年的最后一天要特殊处理,否则容易WA,还有这道题是离线处理的,最后输出头一行还得是样例个数。
代码如下:
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
char haab[20][10]={{"\0"},{"pop"},{"no"},{"zip"},{"zotz"},{"tzec"},{"xul"},{"yoxkin"},{"mol"},{"chen"},{"yax"},{"zac"},{"ceh"},
{"mac"},{"kankin"},{"muan"},{"pax"},{"koyab"},{"cumhu"},{"uayet"}};
char tzolkin[261][10];
char tzo[21][10]={{"\0"},{"imix"},{"ik"},{"akbal"},{"kan"},{"chicchan"},{"cimi"},{"manik"},{"lamat"},{"muluk"},{"ok"},{"chuen"},
{"eb"},{"ben"},{"ix"},{"mem"},{"cib"},{"caban"},{"eznab"},{"canac"},{"ahau"}};
int tzol[261];
int main()
{
int n,y,d,ans;
char s1[10],s2[10];
queue<int> Q;
for(int i=1,t1=1,t2=1;i<=260;i++)
{
strcpy(tzolkin[i],tzo[t1++]);
tzol[i]=t2++;
if(t1>20) t1=1;
if(t2>13) t2=1;
}
/*for(int i=1;i<=260;i++)
cout<<tzol[i]<<' '<<tzolkin[i]<<endl;*/
scanf("%d",&n);
Q.push(n);
while(n--)
{
d=0;
scanf("%s%s%d",s1,s2,&y);
for(int i=strlen(s1)-1,first=1;i>=0;i--)
{
if(isdigit(s1[i]))
{
if(first)
{
first=0;
d+=s1[i]-'0';d++;
}
else d+=(s1[i]-'0')*10;
}
}//cout<<d<<endl;
for(int i=1;i<=19;i++)
{
if(strcmp(haab[i],s2)==0)
{
d+=(i-1)*20;
break;
}
}//cout<<d<<endl;
d+=y*365;//cout<<d<<endl;
ans=d/260;
d%=260;
if(!d) //一定要小心这个!!!
{
d=260;
ans--;
}
Q.push(d); Q.push(ans);
}
printf("%d\n",Q.front()); Q.pop();
while(!Q.empty())
{
d=Q.front(); Q.pop();
ans=Q.front(); Q.pop();
printf("%d %s %d\n",tzol[d],tzolkin[d],ans);
}
return 0;
}
TIPS:遇到取余的情况,要考虑取余后的值为0是否会有影响。