poj_1006 Biorhythms
来源:互联网 发布:编程初级教学书 编辑:程序博客网 时间:2024/05/22 11:42
题目链接:http://poj.org/problem?id=1006
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 101167 Accepted: 31195
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.
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.
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
East Central North America 1999
代码:
#include<iostream>using namespace std;int main(){int p,i,e,d,ans;while(scanf("%d%d%d%d",&p,&e,&i,&d)!=EOF){if(p==-1&&e==-1&&i==-1&d==-1)break;int a,b,c;for(a=0;a<33;a++){if(a*23*28%33==1)break;}for(b=0;b<33;b++){if(b*23*33%28==1)break;}for(c=0;c<33;c++){if(c*28*33%23==1)break;}ans=(a*23*28*i+b*23*33*e+c*28*33*p-d+23*28*33)%(23*28*33);if(ans==0)ans=23*28*33;printf("%d\n",ans);}}
- poj_1006 Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- zoj1160 Biorhythms
- 1006 Biorhythms
- 1006 Biorhythms
- JOJ1491:Biorhythms
- POJ1006 Biorhythms
- POJ1006 Biorhythms
- 【总有一些东西老是忘】之——常见HTML的块级标签、内联标签
- 历史名人5——亚历山大大帝
- RTSP 协议分析(一)
- 全面介绍Windows内存管理机制及C++内存分配实例(三):虚拟内存
- Learn to speak vim – verbs, nouns, and modifiers!
- poj_1006 Biorhythms
- 开源世界旅行手册
- 全面介绍Windows内存管理机制及C++内存分配实例(四):内存映射文件
- 《恐怖丛林生存》肉搏攻略,解开星星系统之谜
- html之marquee详解
- [转]Go在谷歌:以软件工程为目的的语言设计
- C语言打印菱形字母阵,程序缩短,缩短,再缩短
- poj 1837 Balance (dp 01背包)
- uboot 中s3c2440 usb ohci 及u盘移植