poj1008

水题：http://poj.org/problem?id=1008

#include<stdio.h>#include<string>#include<string.h>#include<algorithm>#include<map>#include<set>#include<queue>#include<vector>#include<iostream>#include<stack>#include<cmath>using namespace std;string str1[20];string str2[20];int main(void){   int n;   scanf("%d",&n);   int flag=0;   for(int l=1;l<=n;l++)   {      string s;      int a,c;      scanf("%d. ",&a);      cin>>s;      scanf(" %d",&c);     str1[0]="pop"; str1[2]="zip"; str1[4]="tzec";      str1[6]="yoxkin";     str1[7]="mol";     str1[1]="no";  str1[3]="zotz"; str1[5]="xul"; str1[8]="chen";     str1[9]="yax";  str1[11]="ceh";  str1[13]="kankin";  str1[15]="pax"; str1[17]="cumhu";     str1[10]="zac";  str1[12]="mac";  str1[14]="muan";  str1[16]="koyab"; str1[18]="uayet";     int sum=0;////pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin, muan, pax, koyab, cumhu     sum+=c*365;    // cout<<a<<" "<<s<<" "<<c;          for(int i=0;i<=19;i++)     {        if(s.compare(str1[i])==0)        {          // cout<<"hello"<<endl;           sum=sum+i*20+a+1;           break;        }     }     str2[1]="imix"; str2[3]="akbal"; str2[5]="chicchan"; str2[7]="manik"; str2[9]="muluk"; str2[11]="chuen"; str2[13]="ben";     str2[2]="ik"; str2[4]="kan"; str2[6]="cimi"; str2[8]="lamat"; str2[10]="ok"; str2[12]="eb";      str2[14]="ix"; str2[16]="cib"; str2[18]="eznab"; str2[0]="ahau";     str2[15]="mem"; str2[17]="caban"; str2[19]="canac";     if(!flag)     {       flag=1;       printf("%d\n",n);     }    // printf("%d %s %d\n",(sum%13),str2[(sum%20)],sum/260);  //  cout<<sum%260<<endl;    int cd=0;    if(sum%13==0)        cd=13;    else cd=sum%13;    cout<<cd<<" "<<str2[(sum%20)]<<" "<<((sum-1)/260)<<endl;   }   return 0;}