zoukankan      html  css  js  c++  java
  • proj 1008

    Maya Calendar
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 63165   Accepted: 19479

    Description

    During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long year, called Haab, which had 19 months. Each of the first 18 months was 20 days long, and the names of the months were pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin, muan, pax, koyab, cumhu. Instead of having names, the days of the months were denoted by numbers starting from 0 to 19. The last month of Haab was called uayet and had 5 days denoted by numbers 0, 1, 2, 3, 4. The Maya believed that this month was unlucky, the court of justice was not in session, the trade stopped, people did not even sweep the floor.

    For religious purposes, the Maya used another calendar in which the year was called Tzolkin (holly year). The year was divided into thirteen periods, each 20 days long. Each day was denoted by a pair consisting of a number and the name of the day. They used 20 names: imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau and 13 numbers; both in cycles.

    Notice that each day has an unambiguous description. For example, at the beginning of the year the days were described as follows:

    1 imix, 2 ik, 3 akbal, 4 kan, 5 chicchan, 6 cimi, 7 manik, 8 lamat, 9 muluk, 10 ok, 11 chuen, 12 eb, 13 ben, 1 ix, 2 mem, 3 cib, 4 caban, 5 eznab, 6 canac, 7 ahau, and again in the next period 8 imix, 9 ik, 10 akbal . . .

    Years (both Haab and Tzolkin) were denoted by numbers 0, 1, : : : , where the number 0 was the beginning of the world. Thus, the first day was:

    Haab: 0. pop 0

    Tzolkin: 1 imix 0
    Help professor M. A. Ya and write a program for him to convert the dates from the Haab calendar to the Tzolkin calendar.

    Input

    The date in Haab is given in the following format:
    NumberOfTheDay. Month Year

    The first line of the input file contains the number of the input dates in the file. The next n lines contain n dates in the Haab calendar format, each in separate line. The year is smaller then 5000.

    Output

    The date in Tzolkin should be in the following format:
    Number NameOfTheDay Year

    The first line of the output file contains the number of the output dates. In the next n lines, there are dates in the Tzolkin calendar format, in the order corresponding to the input dates.

    Sample Input

    3
    10. zac 0
    0. pop 0
    10. zac 1995

    Sample Output

    3
    3 chuen 0
    1 imix 0
    9 cimi 2801

    Source

    /*Filename:KMP.cpp*/
    #include "stdafx.h"
    #include<iostream>
    #include<string>
    #include<string.h>
    using namespace std;

    int *compute_next(char *T){
        int n = strlen(T);
        int *next = new int[n];
        int k = 0;
        next[0] = -1;
        for(int j = 1;j < n;++j){
            if(((T[j] == T[0])&&(k == 0))||((k != 0)&&(T[k] == T[j])&&(T[k] == T[0]))){
                next[j] = -1;
            }else if((k != 0)&&(T[j] != T[k])){
                next[j] = k;
            }else{
                next[j] = 0;
            }
            if(k == 0){
                if(T[j] == T[0]&&j > 0){
                    ++k;   
                }
            }else{
                if(T[j] == T[k]){
                    ++k;
                }else if(T[j] == T[0]){
                    k = 1;
                }else{
                    k = 0;
                }
            }
       //cout<<k<<endl;
        }
        return next;
    }
    bool equal(char *s1, char *s2){
     int i = 0;
     while((s1[i] == s2[i])&& (s1[i] != '')){
      ++i;
     }
     if((s1[i] == '')&& (s2[i] == '')){
      return true;
     }else{
      return false;
     }
    }

    int days(int day, char *month, int year){
     char *s[] = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu","uayet"};
     int m = 0;
     while(!equal(month, s[m])){
      ++m;
     }
     int days = m*20 + day + 365*year + 1;
     return days;
    }

    void print(int days){
     char *s[] = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"};
     int year = days/260;
     int day = (days - 260*year)/20;
     int num = (days - 260*year)%13;
     if(num == 0){
      num = 13;
      day = 19;
     }
     //cout<<year<<" "<<day<<" "<<num<<endl;
     cout<<num<<" "<<s[day]<<" "<<year<<endl;
    }

    int main(){
        char *T = "ababcaabc";
        int *next = compute_next(T);
        print(days(10,"zac",0));
        print(days(0,"pop",0));
        print(days(10,"zac",1995));
        print(days(4,"uayet",259));
     
        return 0;
    }

  • 相关阅读:
    简析IGRP
    unicode字符集查找
    中国移动建成全球最大软交换网络 适合向3G过渡
    寻找端口与进程的关联
    framerelay
    网络工程师的素质
    E1通信的基础知识
    Indy UDP端口冲突解决
    『软考』接入网的分类
    随便写写。。
  • 原文地址:https://www.cnblogs.com/candycloud/p/3390280.html
Copyright © 2011-2022 走看看