poj 1006 Biorhythms
来源:互联网 发布:linux 关闭端口命令 编辑:程序博客网 时间:2024/05/15 03:37
Biorhythms
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 96885 Accepted: 29791
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.
中国剩余定理
已知的条件 : (n+d)%23=p; (n+d)%28=e; (n+d)%33=i ,求n
#include<iostream>#include<cstdio>using namespace std;int gcd(int x,int y) //求最大公约数{ return (y?gcd(y,x%y):x);}int main(){ int p,e,i,d,n; int c=1; int zux,p1,e1,i1; int j; while(cin>>p>>e>>i>>d) { if(p==-1&&e==-1&&i==-1&&d==-1) break; for(j=1;;j++) if((28*33*j)%23==1) { p1=28*33*j; break; } for(j=1;;j++) if((23*33*j)%28==1) { e1=23*33*j; break; } for(j=1;;j++) if((23*28*j)%33==1) { i1=23*28*j; break; } zux=gcd(23,28); zux=gcd(zux,33); zux=23*28*33/zux; //求23,28,33的最小公倍数 n=(p1*p+e1*e+i*i1+zux)%zux-d; if(n<=0) n+=zux; printf("Case %d: the next triple peak occurs in %d days.\n",c++,n); }}
- poj 1006 Biorhythms
- poj 1006 Biorhythms
- poj 1006 Biorhythms
- POJ 1006 Biorhythms
- POJ 1006 Biorhythms
- POJ 1006 Biorhythms
- 【POJ】1006 Biorhythms
- POJ-1006:Biorhythms
- POJ 1006 Biorhythms
- POJ 1006 Biorhythms
- POJ 1006 Biorhythms
- poj 1006 Biorhythms
- POJ 1006 Biorhythms
- Poj 1006 Biorhythms
- POJ 1006 Biorhythms
- poj 1006 hdu1370 Biorhythms
- 【POJ】1006 Biorhythms
- poj 1006 Biorhythms
- qtp10 录制时,弹出Internet explorer已停止工作
- javascript中return的作用
- LISP语言
- WP7 Debug模式下右上角的数字代表什么
- Giving gdb permission to control other processes
- poj 1006 Biorhythms
- NO drives,assigned,SHSUCDX can't install 的解决办法
- ubuntu下命令行连接wifi
- Units specified don't exist SHSUCDX can't install
- hashchange Event – 监测URL的hash变化
- 外部接口交互
- 用java操作数据库和excel(二)
- Python入门(二)
- Name That Number