POJ-1008-Maya Calendar

很简单的一个模拟题

代码：

#include<iostream> 
#include<string> 
using namespace std; 
string m1[19]={"pop","no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu","uayet"}; 
string m2[20]={"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"}; 
//int m3[13]={1,8,2,9,3,10,4,11,5,12,7,1,8}; 
struct haab 
{ 
    int y; 
    string m; 
    int d; 
}; 
struct tiolkin 
{ 
    int yy; 
    string mm; 
    int dd; 
}; 
int main() 
{ 
    int n,i; 
    cin>>n; 
    cout<<n<<endl; 
    char t; 
    for(i=0;i<n;i++) 
    { 
        haab s; 
        tiolkin z; 
        cin>>s.d>>t>>s.m>>s.y; 
        int sum=0,p,w,r; 
        for(p=0;p<19;p++) 
        { 
        if(s.m==m1[p]) 
            break; 
        } 
        sum=s.y*365+p*20+s.d; 
        z.yy=sum/260; 
        w=sum%20; 
        r=sum%13+1; 
        z.mm=m2[w]; 
        z.dd=r; 
        cout<<z.dd<<' '<<z.mm<<' '<<z.yy<<endl; 
    } 
  
    return 0; 
}