Biorhythms
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4879 Accepted Submission(s): 1912
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.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Case 1: the next triple peak occurs in 1234 days.
Use the plural form ``days'' even if the answer is 1.
参考别人的翻译:
Description
人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)。
Input
输入N, case从N开始计数
输入四个整数:p, e, i和d。 p, e, i分别表示体力、情感和智力高峰出现的时间(时间从当年的第一天开始计算)。d 是给定的时间,可能小于p, e, 或 i。 所有给定时间是非负的并且小于365, 所求的时间小于21252。
当p = e = i = d = -1时,输入数据结束。
Output
从给定时间起,下一次三个高峰同天的时间(距离给定时间的天数)。
采用以下格式:
Case 1: the next triple peak occurs in 1234 days.
注意:即使结果是1天,也使用复数形式“days”。
思路:
此题相当于解方程组
x+d≡p(mod 23)
x+d≡e(mod 28)
x+d≡i(mod 33)
由于23,28,33两两互素,所以M=23*28*33=21252,M1=924,M2=759,M3=644.
则有924y1≡1(mod 23),由924/23=(40,5,1,3)计算得y1=6(mod 23)
则有759y2≡1(mod 28),由759/28=(27,9,2,1)计算得y2=19(mod 28)
则有644y3≡1(mod 33),由644/33=(19,1,1,16)计算得y3=2(mod 33)
因此x+d≡(5544p+14421e+1288i)(mod 21252)
即x=(5544*p+14421*e+1288*i-d)%21252
本题所求的是最小整数解,避免x为负,因此最后结果为x=(x+21252)%21252
那么最终求解x的表达式就是:
x=(5544*p+14421*e+1288*i-d+21252)%21252
(若x为0,就令x为21252)
AC代码:
(1)本题可直接计算出3个逆元然后代入:
#include<cstdio>
using namespace std;
int main()
{
int N;
int p, e, i, d, icase = 0, x;
scanf("%d",&N);
while (scanf("%d%d%d%d", &p, &e, &i, &d), ~p)
{
x = (5544 * p + 14421 * e + 1288 * i - d + 21252) % 21252;
if (x == 0) x = 21252;
printf("Case %d: the next triple peak occurs in %d days.\n", N++, x);
}
return 0;
}
(2)还可调用函数逐个求逆元:
#include <stdio.h>
int exgcd(int a,int b,int &x,int &y)
{
if(b==0){
x=1;
y=0;
return a;
}
int ans=exgcd(b,a%b,x,y);
int temp=x;
x=y;
y=temp-a/b*y;
return ans;
}
//求逆元的模板,gcd为1说明逆元存在,gcd不为1说明逆元不存在
int inverse(int a,int n)//n为mod的那个数
{
int d,x,y;
d=exgcd(a,n,x,y);
return d==1?(x+n)%n:-1;
}
//求M1的逆元y1:M1*y1=1(modm1)
/*
x+d=p(mod 23)
x+d=e(mod 28)
x+d=i(mod 33)
求解最小公倍数 x
x+d=(p*M1*y1+e*M2*y2+i*M3*y3+M)%M;
x=(p*M1*y1+e*M2*y2+i*M3*y3+M)%M-d;
*/
int main()
{
int M,M1,M2,M3,y1,y2,y3;
int N;//case的起点
int p,e,i,d;
int z;
M1=28*33;M2=23*33;M3=23*28;M=23*28*33;
y1=inverse(M1,23);y2=inverse(M2,28);y3=inverse(M3,33);
scanf("%d",&N);
while(~scanf("%d%d%d%d",&p,&e,&i,&d))
{
if(p==-1&&e==-1&&i==-1&&d==-1) return 0;
z=(p*M1*y1+e*M2*y2+i*M3*y3-d+M)%M;
if(z==0) z=21152;
printf("Case %d: the next triple peak occurs in %d days.\n",N++,z);
}
return 0;
}