玛雅历__牛客网

上周末，M.A 教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有 365 的叫做 Haab 的日历。这个 Haab 日历拥有 19 个月，在开始的 18 个月，一个月有 20 天，月份的名字分别是 pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, mac, kankin, muan, pax, koyab, cumhu. 这些月份中的日期用 0 到 19 表示。Haab 历的最后一个月叫做 uayet，它只有 5 天，用 0 到 4 表示。玛雅人认为这个日期最少的月份是不吉利的，在这个月法庭不开庭，人们不从事交易，甚至没有人打扫屋中的走廊。
因为宗教的原因，玛雅人还使用了另一个日历，在这个日历中年被称为 Tzolkin(holly年)，一年被分成 13 个不同的时期，每个时期有 20 天，每一天用一个数字和一个单词相组合的形式来表示。使用的数字是 1~13，使用的单词共有 20 个，它们分别是：imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau。注意：年中的每一天都有着明确的描述，比如，在一年的开始，日期如下描述： 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, 8 imix, 9 ik, 10 akbal………也就是说数字和单词各自独立循环使用。
Hab 历和 Tzolkin 历中的年都用数字 0，、1、2…… 示表，数字 0 表示世界的开始。所所以第一天被表示成：Haab: 0 pop 0（Day Month Year格式），Tzolkin: 1 imix 0。
请帮助 M.A.教授写一个程序可以把 Haab 历转化成 Tzolkin 历。

int main() { //freopen("in.txt", "r", stdin); vector<string> Haab{ "pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu" }; vector<string> Tzolkin{ "imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau" }; int day, month, year; int t_year, t_num, t_name; string s; while (cin >> day >> s >> year) { for (month = 0; month < Haab.size(); ++month) if (s == Haab[month]) break; int count = year * 365 + month * 20 + day + 1; t_year = (count - 1) / 260; count %= 260; t_num = count % 13; if (t_num == 0) t_num = 13; t_name = count % 20; if (t_name == 0) t_name = 20; cout << t_num << " " << Tzolkin[t_name - 1] << " " << t_year << endl; } return 0; }

import java.util.*; public class Main { static String[] haab = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"}; static String[] tzolkin = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"}; public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int day = sc.nextInt(); String month = sc.next(); int year = sc.nextInt(); int sumday = day + year * 365; for (int i = 0; i < haab.length; i ++ ) { if(haab[i].equals(month)) { sumday += i * 20; break; } } year = sumday / 260; day = sumday % 260 % 13 + 1; System.out.println(day + " " + tzolkin[sumday % 260 % 20] + " " + year); } } }

#include <iostream> #include <string> #include <vector> using namespace std; const vector<string> Habb = { "pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu" }; const vector<string> Tzolkin = { "imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau" }; int countHabbDay(int day, string name, int year) { int month; for (int i = 0; i < Habb.size();++i) if (Habb[i] == name) { month = i; break; } return 20 * month + day + 1 + year * 365; } void calcTzolkinDay(int & day, string & dayName, int & year, int count) { year = (count - 1) / (13 * 20); int dayNum = (count - 1) % (13 * 20) + 1; day = (dayNum - 1) % 13 + 1; dayName = Tzolkin[(dayNum - 1) % 20]; } int main() { int HabbDay, HabbYear; string HabbMonth; while (cin >> HabbDay >> HabbMonth >> HabbYear) { int count = countHabbDay(HabbDay, HabbMonth, HabbYear); int TzolkinDay, Tzolkinyear; string Tzolkinmonth; calcTzolkinDay(TzolkinDay, Tzolkinmonth, Tzolkinyear, count); cout << TzolkinDay << " " << Tzolkinmonth << " " << Tzolkinyear << endl; } return 0; }

玛雅历

输入描述:

输出描述:

输入

输出

问题信息

热门推荐

通过挑战的用户

相关试题