【poj 1008】

最新推荐文章于 2024-11-04 19:44:07 发布

dieleila9149

最新推荐文章于 2024-11-04 19:44:07 发布

阅读量100

点赞数

文章标签：测试

原文链接：http://www.cnblogs.com/FZQL/archive/2013/04/30/3052294.html

版权

本文介绍了一种解析玛雅历法的算法，通过输入玛雅历法中的天数、月名和年份，该算法可以计算出对应的长计日历（Long Count Calendar）中的天数、图腾名和纪元年。此算法使用了C++编程语言，并利用了标准库中的数据结构和输入输出流。

摘要由CSDN通过智能技术生成

每年的最后一天要考虑

#include <fstream>
#include <string>
#include <map>
using namespace std;
int main()
{
    int n , i ;

    scanf("%d" , &n ) ;

    int hdd , hyy , tdd[n] , tnn[n] , tyy[n] , total , day ;
    char pp,hmon[7] , tname[21][9] = { "oooo" , "imix" , "ik" , "akbal" , "kan" , "chicchan" , "cimi" , "manik" , "lamat" , "muluk" , "ok" , "chuen" , "eb" , "ben" , "ix" , "mem" , "cib" , "caban" , "eznab" , "canac" , "ahau" };
    map<string, int> hmm ;
    hmm["pop"] =  0;
    hmm["no"] =  1;
    hmm["zip"] =  2;
    hmm["zotz"] =  3;
    hmm["tzec"] =  4;
    hmm["xul"] =  5;
    hmm["yoxkin"] =  6;
    hmm["mol"] =  7;
    hmm["chen"] =  8;
    hmm["yax"] =  9;
    hmm["zac"] =  10;
    hmm["ceh"] =  11;
    hmm["mac"] =  12;
    hmm["kankin"] =  13;
    hmm["muan"] =  14;
    hmm["pax"] =  15;
    hmm["koyab"] =  16;
    hmm["cumhu"] =  17;
    hmm["uayet"] =  18;


    for ( i = 0 ; i < n ; i++)
    {
        scanf("%d%c %[^ ] %d", &hdd , &pp , hmon , &hyy );
        total = 1 + hdd + hmm[hmon] * 20 + hyy * 365;
        tyy[i] = total / 260 ;
        day = total % 260 ;
        if ( day == 0 ) tyy[i]-- ;
        tdd[i] = day % 13 ;
        if ( tdd[i] == 0 ) tdd[i] = 13 ;
        tnn[i] = day % 20 ;
        if ( tnn[i] == 0 ) tnn[i] = 20 ;
    }
    printf("%d\n",n);
    for ( i = 0 ; i < n ; i++) printf("%d %s %d\n" , tdd[i] , tname[tnn[i]] , tyy[i] );
    return 0;
}