zoukankan      html  css  js  c++  java
  • POJ 1008: Maya Calendar

    #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;
    }
    View Code

    //模拟,注意把那个“."给读走。。

  • 相关阅读:
    RAM调优之日志分析
    HDU Always Cook Mushroom (极角排序+树状数组)
    并非全部的程序猿都适合做技术管理
    HTTP Header具体解释
    Linux 通配符
    寻找正在连接中的网络连接
    hdu 1052 田忌赛马
    linux上电自启动应用程序具体解释
    C++ 中的 const 类型变量
    FileUtil
  • 原文地址:https://www.cnblogs.com/Rhythm-/p/9336972.html
Copyright © 2011-2022 走看看