zoukankan      html  css  js  c++  java
  • poj 1008

    #include<iostream>
    #include<string>

    using namespace std;
    string hname[19] = { "pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet" };
    string tname[20] = { "imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau" };
    int main()
    {
        int n;
        cin >>n;
        cout <<n <<endl ;
       for (int j = 0; j < n; j++)
        {
            int sum = 0;
            int date,year;
            char c;
            string month;
            cin >> date;
            cin >> c;
            cin >> month>> year;

            if(year) sum += 365*year;
            int i = 0;
             for (int i = 0; i < 19; i++)
            {
                if(month==hname[i])
                {
                    sum+=i*20;
                    break;
                }
            }

            sum += (date+1);
            cout <<(sum-1)%13+1<<" "<<tname[(sum-1)%20]<<" "<<(sum-1)/260<<endl;



        }
        return 0;

    }

  • 相关阅读:
    链表操作
    51nod1085-----01背包
    51nod1046快速幂取余
    51nod贪心算法入门-----任务分配问题
    51nod动态规划-----矩阵取数
    51nod贪心算法入门-----独木舟问题
    POJ2255二叉树
    POJ1182并查集
    POJ1384完全背包问题
    20162313_苑洪铭_ 第7周学习总结
  • 原文地址:https://www.cnblogs.com/lipenglin/p/4400914.html
Copyright © 2011-2022 走看看