Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 45762 | Accepted: 12830 |
Description
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
Output
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.
中文翻译为:
生理周期
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 45762 Accepted: 12830 Description
人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)。Input
输入四个整数: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”。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 -1Sample 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.自己写了个程序,结果对了,总是不能ac,网上查了一下这个可以用中国剩余定理做,例1:一个数被3除余1,被4除余2,被5除余4,这个数最小是几?
题中3、4、5三个数两两互质。
则〔4,5〕=20;〔3,5〕=15;〔3,4〕=12;〔3,4,5〕=60。
为了使20被3除余1,用20×2=40;
使15被4除余1,用15×3=45;
使12被5除余1,用12×3=36。
然后,40×1+45×2+36×4=274,
因为,274>60,所以,274-60×4=34,就是所求的数。
又在这里查到关于这个题目的说明,http://www.cppblog.com/AClayton/archive/2008/08/07/32186.html,
自己理解了写了一个,也不能ac,主要是细节问题,在小于零时没有进行判断
完整的代码是:
#include <iostream>
using namespace std;
int main()
{
int p,e,i,d;
int count=1;
while (cin>>p>>e>>i>>d)
{
if (p==-1)
{
break;
}
else
{
int result=(1288*i+14421*e+5544*p-d+21252)%21252;
if (result==0)
{
result=21252;
}
cout<<"Case "<<count<<": the next triple peak occurs in "<<result<<" days."<<endl;
count++;
}
}return 0;
}还有那个没有ac的代码是:
#include<iostream>
using namespace std;
int main()
{
int p,e,i,d,result[10000];
int casecount=1;
int count=1;
while (cin>>p>>e>>i>>d)
{
if (p==-1&&e==-1&&i==-1&&d==-1)
{
break;
}
else
{while (1)
{
int tmp=p+count*23;
if ((tmp-e)%28==0&&(tmp-i)%33==0)
{
result[casecount]=tmp-d;
casecount++;
break;
}
else
{
count++;
}
}
}
count=1;
}
int j=1;
for (;j<casecount;j++)
{
if (result[j]<=0)
{
result[j]=21252+result[j];
}
cout<<"Case "<<j<<": the next triple peak occurs in "<<result[j]<<" days."<<endl;}
return 0;
}哪位高手帮忙指点一下为什么不能ac