acm-Biorhythms
来源:互联网 发布:日本爱知世博会ppt 编辑:程序博客网 时间:2024/04/30 13:26
Biorhythms
- 描述
Some peoplebelieve that there are three cycles in a person's life that startthe day he or she is born. These three cycles are the physical,emotional, and intellectual cycles, and they have periods oflengths 23, 28, and 33 days, respectively. There is one peak ineach period of a cycle. At the peak of a cycle, a person performsat his or her best in the corresponding field (physical, emotionalor mental). For example, if it is the mental curve, thoughtprocesses will be sharper and concentration will beeasier.
Since the three cycles have different periods, the peaks of thethree cycles generally occur at different times. We would like todetermine when a triple peak occurs (the peaks of all three cyclesoccur in the same day) for any person. For each cycle, you will begiven the number of days from the beginning of the current year atwhich one of its peaks (not necessarily the first) occurs. You willalso be given a date expressed as the number of days from thebeginning of the current year. You task is to determine the numberof days from the given date to the next triple peak. The given dateis not counted. For example, if the given date is 10 and the nexttriple peak occurs on day 12, the answer is 2, not 3. If a triplepeak occurs on the given date, you should give the number of daysto the next occurrence of a triple peak.- 输入
- You will be given at most 1000000 cases. The input for each caseconsists 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 currentyear at which the physical, emotional, and intellectual cyclespeak, respectively. The value d is the given date and may besmaller than any of p, e, or i. All values are non-negative and atmost 365, and you may assume that a triple peak will occur within21252 days of the given date. The end of input is indicated by aline in which p = e = i = d = -1
- 输出
- For each test case, print the number of days to the next triplepeak, in the form:
- 样例输入
0 0 0 00 0 0 1005 20 34 3254 5 6 7283 102 23 320203 301 203 40-1 -1 -1 -1
- 样例输出
21252211521957516994891010789
- 来源
- POJ
解题思路:
中国剩余定理,本题难点不在编程,而是分析题目并转化为数学公式
要引入本题解法,先来看一个故事
已知(n+d)#=p;
两道题是一样的。但是韩信当时计算出结果的?
“韩信点兵”问题计算如下:
因为n%3=2, n%5=3, n%7=2 且3,5,7互质
令x= n%3=2 , y= n%5=3 ,z= n%7=2
那么n =(70×x+21×y+15×z)%lcm(3,5,7) = 23 这是n的最小解
同样,这道题的解法就是:
已知(n+d)#=p;
又23、28、33互质,即lcm(23,28,33)= 21252;
本题所求的是最小整数解,避免n为负,因此最后结果为n= [n+21252]% 21252
那么最终求解n的表达式就是:
n=(5544*p+14421*e+1288*i-d+21252)!252;
当问题被转化为一条数学式子时,你会发现它无比简单。。。。直接输出结果了。
代码:
#include
#include
#include
using namespace std;
int main()
{
}
- acm-Biorhythms
- 北大ACM 1006 Biorhythms
- acm-Biorhythms(poj1006)同余
- ACM —— 1006 Biorhythms
- ACM 数论 hdu 1370 Biorhythms
- 杭电acm 1370Biorhythms
- PKU ACM-1006题 java Biorhythms
- POJ Problem Id1006 :Biorhythms ACM 编程练习
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- Biorhythms
- acm-Fibonacci数列(四)
- Oracle向PostgreSQL移植实例
- acm-光棍节的快乐
- Loadrunner如何选择协议(转)
- acm-p次方求和
- acm-Biorhythms
- acm-Game of Connections
- NYOJ终于过百了
- acm-一个简单的数学题
- acm-最大素因子
- 数论的欧拉证明:欧拉公式
- acm-mdd的烦恼
- acm-A+B Problem II
- SharePoint 2013 App 开发 (1) - 什么是SharePoint App?