博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Biorhythms(poj1006)
阅读量:6303 次
发布时间:2019-06-22

本文共 3570 字,大约阅读时间需要 11 分钟。

Biorhythms
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 92184   Accepted: 28170

Description

Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respectively. There is one peak in each period of a cycle. At the peak of a cycle, a person performs at his or her best in the corresponding field (physical, emotional or mental). For example, if it is the mental curve, thought processes will be sharper and concentration will be easier. 
Since the three cycles have different periods, the peaks of the three cycles generally occur at different times. We would like to determine when a triple peak occurs (the peaks of all three cycles occur in the same day) for any person. For each cycle, you will be given the number of days from the beginning of the current year at which one of its peaks (not necessarily the first) occurs. You will also be given a date expressed as the number of days from the beginning of the current year. You task is to determine the number of days from the given date to the next triple peak. The given date is not counted. For example, if the given date is 10 and the next triple peak occurs on day 12, the answer is 2, not 3. If a triple peak occurs on the given date, you should give the number of days to the next occurrence of a triple peak. 

Input

You will be given a number of cases. The input for each case consists of one line of four integers p, e, i, and d. The values p, e, and i are the number of days from the beginning of the current year at which the physical, emotional, and intellectual cycles peak, respectively. The value d is the given date and may be smaller than any of p, e, or i. All values are non-negative and at most 365, and you may assume that a triple peak will occur within 21252 days of the given date. The end of input is indicated by a line in which p = e = i = d = -1.

Output

For each test case, print the case number followed by a message indicating the number of days to the next triple peak, in the form: 
Case 1: the next triple peak occurs in 1234 days. 
Use the plural form ``days'' even if the answer is 1.

Sample Input

0 0 0 00 0 0 1005 20 34 3254 5 6 7283 102 23 320203 301 203 40-1 -1 -1 -1

Sample Output

Case 1: the next triple peak occurs in 21252 days.Case 2: the next triple peak occurs in 21152 days.Case 3: the next triple peak occurs in 19575 days.Case 4: the next triple peak occurs in 16994 days.Case 5: the next triple peak occurs in 8910 days.Case 6: the next triple peak occurs in 10789 days.

Source

通过例子说明这道题的大意
以 第三个样例 5 20 34 325 为例,p,e,i 三个高峰分别出现在距当年开端的第5天,第20天,第34天,date是距当年开端的第325天。要求date离下一个三重高峰的天数(不算入date)。注意 
5,20, 34并不一定是当年p,e,i各自第一个高峰出现的时间,由题意,p,e,i的周期长度分别为23, 28, and 33,故此此例中三个曲线在当年第一次出现高峰的日期分别是5,20和1(34-33)。
实际上这是一个同余问题。可以应用中国剩余定理。我是直接暴力求解,79ms。如果用scanf会更快。
AC code:
 
#include 
using namespace std;const int lcm=21252;//23,28,33的最小公倍数int main(){ int p,e,i,d,ans,case_i=1; while(cin>>p>>e>>i>>d,p!=-1) { ans=0; if(p>=23) p=p-(p/23)*23; if(e>=28) e=e-(e/28)*28; if(i>=33) i=i-(i/33)*33; for(int j=0;;j++) { ans=j*33+i; if(ans%23==p && ans%28==e) break; } if(ans<=d) { ans+=(d-ans)/lcm*lcm+lcm; } if(ans>d ) ans-=d; if(ans>21252) ans=21252; cout<<"Case "<
<<": the next triple peak occurs in "<
<<" days."<

转载地址:http://ocfxa.baihongyu.com/

你可能感兴趣的文章
9个offer,12家公司,35场面试,从微软到谷歌,应届计算机毕业生的2012求职之路...
查看>>
lvs fullnat部署手册(三)rs内核加载toa篇
查看>>
C++策略模式
查看>>
我的友情链接
查看>>
oracle表分区详解
查看>>
网络编程中常见结构体
查看>>
SSL/TLS原理详解
查看>>
Docker 自定义SSH服务镜像
查看>>
JavaScript强化教程 —— Cocos2d-JS自动JSB绑定规则修改
查看>>
configure: error: in `/root/httpd-2.2.11/srclib/apr': c
查看>>
CentOS7搭建Kubernetes-dashboard管理服务
查看>>
buildroot下查找外部编译器通过ext-toolchain-wrapper调用的参数
查看>>
MySQL Replication 主主配置详细说明
查看>>
Linux的任务调度
查看>>
在Android studio中添加jar包方法如下
查看>>
iframe 在ie下面总是弹出新窗口解决方法
查看>>
分享10款漂亮实用的CSS3按钮
查看>>
安装nginx 常见错误及 解决方法
查看>>
Gorun8电子商城
查看>>
在之前链表的基础上改良的链表
查看>>