xml地图|网站地图|网站标签 [设为首页] [加入收藏]

生理周期,中国剩余定理

生理周期 (poj 1006) 题解,poj1006

人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始下一次三个高峰落在同一天的时间。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2。输入有多组数据,以一行-1结束。

题目链接:

Biorhythms

Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 117973   Accepted: 37026

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.

Source

East Central North America 1999

 

【问题描述】

     人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)。输入有多组数据,以一行-1结束。

0 0 0 0

poj 1006  

题意:

【样例输入】

    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

0 0 0 100

NOI题库  

生理周期

Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 117973   Accepted: 37026

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 -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.

Source

East Central North America 1999

Translator

北京大学程序设计实习2007, Xie Di

 

 

【样例输出】

    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.

5 20 34 325

Time Limit: 1000MS Memory Limit: 10000K

解法:中国剩余定理,看了很多的博客终于总结了自己的模板,也是我入门题了。

【解题思路】

     思路很简单,一开始我是一天一天去搜,先把数据初始化,即如果正好是三个高峰在一起,则全部 1,再搜,搜到三个高峰在一起就输出,交上去之后发现TLE了……果断换思路。

     好吧,其实思路也没有换,只是减少了一些不可能的枚举而已,由题意可知,首先能被23整除的数先算出来,然后在被23整除的基础上,即每次加23,能被28整除的数算出来,然后在被23和28都能整除的基础上,即每次加23*28,能被33整除的数算出来,这样得到的数减去开始的天数即为答案。

4 5 6 7

Description

关于中国剩余定理的解释: http://www.cnblogs.com/yuyixingkong/p/4358300.html   与   与    与  http://blog.csdn.net/u010468553/article/details/38346195  都可以作为参考的博客;

【代码实现】

 1 var p,e,i,d,x,k:longint;
 2 begin
 3  while k=k do
 4   begin
 5    inc(k);
 6    readln(p,e,i,d);
 7    if (p=-1)and(e=-1)and(i=-1)and(d=-1) then
 8     break;
 9    for x:=d 1 to 21252 do
10     if abs(x-p)mod 23=0 then
11      break;
12    while x<=21252 do
13     begin
14      if abs(x-e) mod 28=0 then//注意:先判断,再加,有极限数据,下面同理
15       break;
16      inc(x,23);
17     end;
18    while x<=21252 do
19     begin
20      if abs(x-i) mod 33=0 then
21       break;
22      inc(x,23*28);
23     end;
24    writeln('Case ',k,': the next triple peak occurs in ',x-d,' days.');
25   end;
26 end.

 

(poj 1006) 题解,poj1006 【问题描述】 人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和...

283 102 23 320

人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出现高峰的天数(不一定是第一次高峰出现的时间)。你的任务是给定一个从当年第一天开始数的天数,输出从给定时间开始(不包括给定时间)下一次三个高峰落在同一天的时间(距给定时间的天数)。例如:给定时间为10,下次出现三个高峰同天的时间是12,则输出2(注意这里不是3)。

关于欧几里得和逆元的解释: 与  http://blog.csdn.net/acdreamers/article/details/8220787  都可以作为参考的博客;  

203 301 203 40

Input

转载请注明出处:寻找&星空の孩子

-1 -1 -1 -1

输入四个整数:p, e, i和d。 p, e, i分别表示体力、情感和智力高峰出现的时间(时间从当年的第一天开始计算)。d 是给定的时间,可能小于p, e, 或 i。 所有给定时间是非负的并且小于365, 所求的时间小于21252。 

题目链接:poj1006

#include<stdio.h>
#define LL __int64
LL m[5]={23,28,33};
LL at[5];
LL s;
void exgcd(LL a,LL b,LL &d,LL &x,LL &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        d=a;
        return ;
    }
    else
    {
        exgcd(b,a%b,d,y,x);
        y-=x*(a/b);
    }
}
LL China(int r)
{
    LL Mc=1;
    LL i,Mi,x,y,d,as=0;
    for(i=0; i<r; i  )
        Mc*=m[i];
    for(i=0; i<r; i  )
    {
        Mi=Mc/m[i];
        exgcd(Mi,m[i],d,x,y);
        as=(as Mi*x*at[i])%Mc;
    }
    as-=s;
    if(as<=0)
        as =Mc;
    return as;
}
LL work()
{
    if(!(at[0]%m[0]||at[1]%m[1]||at[2]%m[2]))
        return 23*28*33-s;
    else
        China(3);
}
int main()
{
    int test=1;
    while(scanf("%I64d%I64d%I64d%I64d",&at[0],&at[1],&at[2],&s)!=EOF)
    {
        if(at[0]==-1&&at[1]==-1&&at[2]==-1&&s==-1) break;
        printf("Case %d: the next triple peak occurs in %I64d days.n",test  ,work());
    }
    return 0;
}

 

Case 1: the next triple peak occurs in 21252 days.

当p = e = i = d = -1时,输入数据结束。

Case 2: the next triple peak occurs in 21152 days.

Output

Case 3: the next triple peak occurs in 19575 days.

从给定时间起,下一次三个高峰同天的时间(距离给定时间的天数)。 

Case 4: the next triple peak occurs in 16994 days.

采用以下格式: 
Case 1: the next triple peak occurs in 1234 days. 

Case 5: the next triple peak occurs in 8910 days.

注意:即使结果是1天,也使用复数形式“days”。

Case 6: the next triple peak occurs in 10789 days.

Sample Input

思路很简单,一开始我是一天一天去搜,先把数据初始化,即如果正好是三个高峰在一起,则全部 1,再搜,搜到三个高峰在一起就输出,交上去之后发现TLE了……果断换思路。

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

好吧,其实思路也没有换,只是减少了一些不可能的枚举而已,由题意可知,首先能被23整除的数先算出来,然后在被23整除的基础上,即每次加23,能被28整除的数算出来,然后在被23和28都能整除的基础上,即每次加23*28,能被33整除的数算出来,这样得到的数减去开始的天数即为答案。

Sample Output

 1 var p,e,i,d,x,k:longint; 2 begin 3  while k=k do 4   begin 5    inc; 6    readln; 7    if (p=-1)and(e=-1)and(i=-1)and(d=-1) then 8     break; 9    for x:=d 1 to 21252 do10     if absmod 23=0 then11      break;12    while x<=21252 do13     begin14      if abs mod 28=0 then//注意:先判断,再加,有极限数据,下面同理15       break;16      inc(x,23);17     end;18    while x<=21252 do19     begin20      if abs mod 33=0 then21       break;22      inc(x,23*28);23     end;24    writeln('Case ',k,': the next triple peak occurs in ',x-d,' days.');25   end;26 end.
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.

 

解题思路:

来源:北大郭炜老师。

从d 1天开始,一直试到第21252 天,对其中每个日期k,看是否满足 (k – p)# == 0 && (k – e)( == 0 &&(k-i)3 == 0
如何试得更快? 跳着试!

 1 #include <iostream>
 2 using namespace std;
 3 #define N 21252
 4 int main()
 5 {
 6     int p,e,i,d,caseNo = 0;
 7     while( cin >> p >> e >>i >>d && p!= -1)
 8     {
 9         caseNo   ;
10         int k;
11         for(k = d 1; (k-p)#;   k);
12         for(; (k-e)(; k = 23);
13         for(; (k-i)3; k = 23*28);
14         //cout<<k-d<<endl;
15         cout << "Case " << caseNo <<": the next triple peak occurs in " << k-d << " days." << endl;
16     }
17     return 0;
18 }

 

本文由必威发布于编程,转载请注明出处:生理周期,中国剩余定理