POJ1006 Biorhythms
2015-08-04 19:53
351 查看
Biorhythms
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
Sample Output
m2),x ≡ a3 (mod m3).... x ≡ ar (mod mr), 运用中国剩余定律的条件为m1,m2,m3,...,mr是两两互素的正整数.有模M
= m1m2m3....mr的唯一解。
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 121250 | Accepted: 38176 |
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 0 0 0 0 100 5 20 34 325 4 5 6 7 283 102 23 320 203 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.
解题思路:
本题可以运用中国剩余定律的知识来解,同余方程组为x ≡ a1(mod m1), x ≡ a2(modm2),x ≡ a3 (mod m3).... x ≡ ar (mod mr), 运用中国剩余定律的条件为m1,m2,m3,...,mr是两两互素的正整数.有模M
= m1m2m3....mr的唯一解。
AC代码:
#include<iostream> #include<cstdio> using namespace std; int m[4],a[4],M; void exgcd(int a,int b,int &d,int &x,int &y) { if(b == 0) { x = 1; y = 0; d = a; return; } else { exgcd(b,a%b,d,x,y); int temp = x; x = y; y = temp - (a / b) * y; } } int intChina(int r) { M = 1; int i,Mi,x0,y0,d,ans = 0; for(i=1;i<=r;i++) { M *= m[i]; } for(i=1;i<=r;i++) { Mi = M / m[i]; exgcd(Mi,m[i],d,x0,y0); ans = (ans + Mi * x0 * a[i]) % M; } if(ans < 0) { ans += M; } return ans; } int main() { int p,n,g,k; int cnt = 1; //freopen("1.txt","r",stdin); while(scanf("%d%d%d%d",&p,&n,&g,&k) != EOF && (p != -1 && n != -1 && g != -1 && k != -1)) { a[1] = p ,a[2] = n,a[3] = g; m[1] = 23,m[2] = 28,m[3] = 33; int ans = intChina(3); while(ans <= k) { ans += M; } printf("Case %d: the next triple peak occurs in %d days.\n",cnt++,ans-k); } return 0; }
相关文章推荐
- HDU 4508 湫湫系列故事——减肥记I
- 26.手势识别器(UIGestureRecognizer)
- 毛玻璃效果
- 【Objective-C编程】浅析Objective-C的继承与复合
- IOS强制横竖屏幕切换总结续
- 详解iOS应用程序内使用IAP/StoreKit付费、沙盒(SandBox)测试、创建测试账号流程!【2012-12-11日更新获取"产品付费数量等于0的问题"】
- 乘法逆元 & hdu 1576 A/B
- poj 3620 Avoid The Lakes
- Java数值交换(通过异或^来完成)
- opencv 2.4.11 cuda5.5 总结
- java面向对象编程之反射
- 【Unity3D ugui】使用艺术字
- 边框圆角化方式(原文链接http://www.cnblogs.com/SJP666/p/4678730.html)
- 三角形的内接圆
- 自动拆箱自动装箱
- [MetaHook] Quake Bink function
- c# 可反复打开word2003,word2007文档方法,可直接使用
- 3620 Avoid The Lakes【dfs】
- poj 3620 Avoid The Lakes
- springMVC中的@RequestMapping的作用