The Lucky Week
2016-04-24 09:36
309 查看
The Lucky WeekTime Limit: 2 SecondsMemory Limit: 65536 KBEdward, the headmaster of the Marjar University, is very busy every day and always forgets the date.There was one day Edward suddenly found that if Monday was the 1st, 11th or 21st day of that month, he could remember the date clearly in that week. Therefore, he called such week "The Lucky Week".But now Edward only remembers the date of his first Lucky Week because of the age-related memory loss, and he wants to know the date of theN-th Lucky Week. Can you help him?
Input
There are multiple test cases. The first line of input is an integer T indicating the number of test cases. For each test case:The only line contains four integers Y, M, D andN (1 ≤ N ≤ 109) indicating the date (Y: year,M: month, D: day) of the Monday of the first Lucky Week and the Edward's queryN.The Monday of the first Lucky Week is between 1st Jan, 1753 and 31st Dec, 9999 (inclusive).Output
For each case, print the date of the Monday of the N-th Lucky Week.Sample Input
2 2016 4 11 2 2016 1 11 10
Sample Output
2016 7 11 2017 9 11
题意:当日期为 1,11,21 并且当天为周一时 认为这一周为Lucky Week给出起始lucky week 问之后第N个lucky week的 日期题解:1.暴力找循环节 每400年中有2058个lucky week2.然后就是暴力
#include<stdio.h>int d1[13]= {0,31,28,31,30,31,30,31,31,30,31,30,31};//平年的每个月的天数int d2[13]= {0,31,29,31,30,31,30,31,31,30,31,30,31};//闰年的每个月的天数int y(int g)//判断是闰年还是平年{if(g%400==0||g%4==0&&g%100!=0){return 1;}else{return 0;}}int main(){int t,a,b,c,n;scanf("%d",&t);while(t--){scanf("%d %d %d %d",&a,&b,&c,&n);int we=n/2058;we=we*400;int f=n%2058;while(f)//暴力寻找{if(c==1||c==11||c==21){f--;}if(f==0){break;}if(y(a)){c=c+7;if(c>d2[b]){c=c-d2[b];b=b+1;}if(b>12){a=a+1;b=1;}}else if(!y(a)){c=c+7;if(c>d1[b]){c=c-d1[b];b=b+1;}if(b>12){a=a+1;b=1;}}}printf("%d %d %d\n",a+we,b,c);}}[/code]
相关文章推荐
- 第 9 章 路径分页标签和徽章组件
- Android ProgressBar使用
- "软件包 opera-stable 需要重新安装,但是我无法找到相应的安装文件 " 解决办法
- 【freemarker】使用模板导出word
- HBase 数据库检索性能优化策略
- 多进程DP
- linux硬链接和软链接的区别
- suid sgid sticky-bit 三种特殊权限简介
- centos svn server
- Android下拉刷新
- 机房重构——组合查询
- Android 从网络加载图片
- XDU-1139 猴子吃桃 II (水~斐波那契数列求和) From 西电校赛网络赛
- android Gradle的神奇之处
- BZOJ1338: Pku1981 Circle and Points单位圆覆盖
- 训练深度神经网络的时候需要注意的技巧
- XDU-1138 Z1+Z2 (水~复数相加) From 西电校赛网络赛
- 【bzoj4521】【CQOI2016】【手机号码】【数位dp】
- 优先级队列
- 全端工程师必备技能汇总