Written by razrlele
20:41 February 1, 2016
Biorhythms
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 124772 | Accepted: 39392 |
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.
Sample Input
1 2 3 4 5 6 7 |
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
1 2 3 4 5 6 |
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
思路
题意是指人有三个周期，生理周期，情绪周期，智商周期，三个周期的时间分别是23天，28天，33天，然后每个周期都有个巅峰日，然后给的p、e、i分别是三个周期的各自的巅峰日（比如，在生理周期中的第p天就是生理周期的巅峰日），然后需要注意的是p，e，i不一定比周期本身的数目小，最后给的d就是当前的天数，然后问过多少天三个周期的巅峰日可以重叠到同一天，答案不大于21252。
因此只要求得n满足：
(n+d)%23 == p%23
(n+d)%28 == e%28
(n+d)%33 == i%33
直接一个while暴力就可以解决问题了。
其实这个题目描述是有问题的，又是说每一个周期都一定有一个巅峰日，又没有保证p，e，i小于各自的周期。。。
代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 |
/* * File Name: poj1006.cpp * Author: razrLeLe * Mail: razrlele@gmail.com */ #include <vector> #include <set> #include <deque> #include <queue> #include <algorithm> #include <functional> #include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <string> #include <cstring> #include <string.h> #include <map> #include <cctype> #include <list> #include <stack> #define forn(i, m, n) for( int i = int(m); i < int(n); i++ ) typedef long long ll; using namespace std; #define INF 0x3f3f3f3f #define LOCAL int main(int argc, char ** argv) { #ifdef LOCAL freopen("/home/razrlele/build/data.txt", "r", stdin); freopen("/home/razrlele/build/out.txt", "w", stdout); #endif int p, e, i, d; int casenum = 0; while( scanf("%d %d %d %d", &p, &e, &i, &d) && p >= 0 ){ p %= 23; e %= 28; i %= 33; int ans = d+1; while( ans <= 21252+d ){ if( ans % 23 == p && ans % 28 == e && ans % 33 == i) { ans = printf("Case %d: the next triple peak occurs in %d days.\n" , ++casenum, ans - d); break; } else ans++; } } return 0; } |