poj 1006 Biorhythms(中国剩余定理)
来源:互联网 发布:网络借贷平台排名 编辑:程序博客网 时间:2024/06/05 09:38
题目链接:poj 1006
Biorhythms
Time Limit: 1000MS Memory Limit: 10000K
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
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 + d = p % 23;
x + d = e % 28;
x + d = i % 33;
的最小正整数解x。
23, 28, 33正好是互素的,所以直接普通模板上。CRT函数是扒的别人的,然后按照自己的习惯稍微改了一下。
#include <iostream>#include <vector>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#define MAX 100005#define LL long long#define MM 10005#define INF -0x7f7f7f7fusing namespace std;int a[3], d, x, y, cnt, m[3] = {23, 28, 33};int exgcd(int a, int b){ if(!b) { x = 1; y = 0; return a; } int d = exgcd(b, a % b); int tmp = x; x = y; y = tmp - a / b * y; return d;}int CRT(int n){ int M = 1, ans = 0; for(int i = 0; i < n; i++) M *= m[i]; for(int i = 0; i < n; i++) { int Mi = M / m[i]; exgcd(Mi, m[i]); ans = (ans + Mi * x * a[i]) % M; } if(ans < 0) ans += M; return ans;}int main(){ while(scanf("%d %d %d %d", &a[0], &a[1], &a[2], &d) && !(a[0] == -1 && a[1] == -1 && a[2] == -1 && d == -1)) { int ans = CRT(3) - d; if(ans <= 0) ans += 21252; printf("Case %d: the next triple peak occurs in %d days.\n", ++cnt, ans); } return 0;}
运行结果:
- poj 1006 Biorhythms(中国剩余定理)
- POJ 1006 Biorhythms(中国剩余定理)
- poj 1006 Biorhythms 中国剩余定理
- POJ 1006 Biorhythms 中国剩余定理
- POJ 1006 Biorhythms 中国剩余定理
- POJ 1006 Biorhythms (中国剩余定理)
- POJ 1006 Biorhythms 中国剩余定理
- poj 1006 Biorhythms 中国剩余定理
- Biorhythms(poj 1006)(中国剩余定理)
- 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(中国剩余定理)
- JAVA反序列化安全
- 把Android原生的View渲染到OpenGL Texture
- 陆金所计算年化收益率
- kali dns信息收集
- binlog,redo log,undo log区别
- poj 1006 Biorhythms(中国剩余定理)
- 百度CTF
- 使用react-native,reduce开发简洁且的上拉刷新下拉加载更多的组件
- 去掉字符串最后一个字符
- [概率DP] Codeforces 453A Little Pony and Expected Maximum
- TreeMap源码解析
- 用80/20法则迅速拓展程序员学习的广度
- 矩阵乘法(POJ 3233 Matrix Power Series )
- 新手上路,对java的肤浅理解,探讨交流