题目描述
输入
输出
样例输入
样例输出
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <iostream> #include <string> #include <cstdio> #include <cmath> #include <cstring> #include <algorithm> #include <vector> #include <queue> #include <deque> #include <map> #define range(i,a,b) for(int i=a;i<=b;++i) #define LL long long #define rerange(i,a,b) for(int i=a;i>=b;--i) #define fill(arr,tmp) memset(arr,tmp,sizeof(arr)) using namespace std; string strs1[20]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"}; string strs2[20]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; int t; void init() { cin>>t; cout<<t<<endl; } void solve(){ while(t--){ int day,year,n; string mon;char c; cin>>day>>c>>mon>>year; range(i,0,18)if(mon==strs1[i])n=20*i; n+=day+1+365*year; year=(n-1)/260; n=n%260?n%260:260; day=n%13?n%13:13; n=n%20?n%20:20; cout<<day<<' '<<strs2[n-1]<<' '<<year<<endl; } } int main() { init(); solve(); return 0; }
//模拟,注意把那个“."给读走。。