【POJ】1008 Maya Calendar
参考:https://blog.csdn.net/u011392408/article/details/28866779
https://blog.csdn.net/qq_36424540/article/details/78234240
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 int d,y; 6 string s; 7 //string sh[]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu"}; 8 //string st[]={"","imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; 9 char sh[25][10]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};//用strig数组过不了,望来个大神解答一下! 10 char st[25][10]={"","imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"}; 11 int turn(int dd,string ss,int yy)//求总的天数 12 { 13 int days,i; 14 for (i=0;ss!=sh[i];i++); 15 days=20*i+dd+yy*365; 16 return days; 17 } 18 int main() 19 { 20 int t; 21 // freopen("F:\\ACM\\text.txt","r",stdin); 22 while (cin>>t) 23 { 24 cout<<t<<endl; 25 while (t--) 26 { 27 char c; 28 cin>>d>>c>>s>>y; 29 int real=turn(d,s,y)+1; 30 int yt=real/260,days=real%260;//yt为转化后的年 31 if (days==0) 32 { 33 yt--; 34 days=260; 35 } 36 int dt=days%13;//int dt=days%13+1,dn=days%20+1这样写是不对的! 37 if (dt==0) 38 { 39 dt=13; 40 } 41 int dn=days%20; 42 if (dn==0) 43 { 44 dn=20; 45 } 46 cout<<dt<<' '<<st[dn]<<' '<<yt<<endl; 47 } 48 } 49 50 return 0; 51 }
转载于:https://www.cnblogs.com/hemeiwolong/p/9394949.html
【POJ】1008 Maya Calendar相关推荐
- 【POJ】1067 取石子游戏(博弈论)
Description 有两堆石子,数量任意,可以不同.游戏开始由两个人轮流取石子.游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子:二是可以在两堆中同时取走相同数量的石子.最后 ...
- 【C#】wpf自定义calendar日期选择控件的样式
原文:[C#]wpf自定义calendar日期选择控件的样式 首先上图看下样式 原理 总览 ItemsControl内容的生成 实现 界面的实现 后台ViewModel的实现 首先上图,看下样式 原理 ...
- 【POJ】2676-Sudoku 【51Nod】1211-数独(DFS)
[POJ]2676-Sudoku Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25200 Accepted: 11782 Sp ...
- 【POJ】 1014 Dividing(多重背包,优化)
[POJ] 1014 Dividing(多重背包,优化) [题目链接]http://poj.org/problem?id=1014 题目 Description Marsha and Bill own ...
- 【POJ】1456 supermarket
[POJ]1456 supermarket 给定 n 件物品,第 i件物品有如下信息: 卖出去可以得到pi的收益. 过期时间为di ,过了过期时间就不能再卖出去. 卖掉一件物品要用 1 的时间,求最大 ...
- POJ - 1008 Maya Calendar
简单模拟,现将第一种日历表示的天数计算出来,再转换为第二种日历.注意边写边检查 POJ - 1008Maya Calendar Time Limit: 1000MS Memory Limit: 100 ...
- 【HDOJ】1008 Elevator_天涯浪子_新浪博客
[题目] http://acm.hdu.edu.cn/showproblem.php?pid=1008 [报告] 这是我在HDOJ里看到的最水的题目,至少目前为止. 题目里已经讲得很清楚了,模拟就能过 ...
- 百炼1008:Maya Calendar
描述 During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya cal ...
- 【POJ】3268 Silver Cow Party (将有向图的边反转)
问题链接:http://poj.org/problem?id=3268 [问题描述] One cow from each of N farms (1 ≤ N ≤ 1000) conveniently ...
最新文章
- java 8 lambda表达式
- Golang 匿名结构体及测试代码编写技巧
- (转)Fedora 17 安装完全指南
- MJRefresh的用法
- 离散系数的计算公式_如何求不同变量之间的离散程度
- MySQL常用数据类型
- 梯度下降法快速教程 | 第二章:冲量(momentum)的原理与Python实现
- npm 可视化html编辑器,超给力 Vue.js 可视化H5拖拽编辑器Quark-H5
- 数据结构java版 大学_数据结构(Java版)
- ABP框架 配置权限、本地语言文件、左侧菜单项
- 相关性分析的五种方法
- 苹果手机怎么编程c语言,C语言编程ios版下载_C语言编程苹果版
- 51单片机+ESP8266-01WIFI模块实现数据传输
- MSSQL 和 MYSQL 复制表结构和数据(B复制A)
- IOS 音乐播放器
- 联想ThinkPad升级BIOS和EC新手教程
- java爬取当当网所有分类的图书信息(ISBN,作者,出版社,价格,所属分类等)
- MT2014——打靶
- 派大汤的数据结构错题本
- RPG角色扮演C++
热门文章
- 高性能无线电综合测试仪都有哪些功能和特点
- 【Zabbix_6.x 第一章】概述、功能、术语、架构
- 信息管理导论川大667 | 第五章核心知识点
- w5100 资料整理
- 灰度化(Grayscale)
- java混淆工具 jdk11 免费代码混淆 字符串混淆
- B. Numbers on the Chessboard -codeforces1027 -csdn博客
- 赛门铁克企业级防病毒产品 》(Symantec Endpoint Protection)V11.0.6005.562 简体中文版[压缩包]
- windows 2003韩文版SP1和SP2补丁
- display的用法