Biorhythms (poj 1006)

原创 2018年04月15日 17:41:44
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.

详解见此博客:https://www.cnblogs.com/MashiroSky/p/5918158.html

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;
int d;
int m[3]={23,28,33};
int a[3];
int counts;

int extgcd(int a,int b,int& x,int& y)
{
    int d=a;
    if(b!=0){
        d=extgcd(b,a%b,y,x);
        y-=(a/b)*x;
    }
    else{
        x=1,y=0;
    }
    return d;
}
int GRT(int n)
{
    int M=1;
    for(int i=0;i<n;i++)
        M*=m[i];
    int ret=0;
    for(int i=0;i<n;i++){
        int x,y;
        int tm=M/m[i];
        extgcd(tm,m[i],x,y);
        ret=(ret+tm*x*a[i])%M;
    }
    return (ret+M)%M;
}
int main()
{
    while(scanf("%d%d%d%d",&a[0],&a[1],&a[2],&d)!=EOF){
        counts++;
        if(a[0]==-1&&a[1]==-1&&a[2]==-1&&d==-1){
            break;
        }
        if(a[0]==0&&a[1]==0&&a[2]==0)
        {
            int num = m[0]*m[1]*m[2]-d;
            printf("Case %d: the next triple peak occurs in %d days.\n",counts,num);
        }
        else{
            int num = GRT(3)-d;
            if(num<=0){
                num+=21252;
            }
            printf("Case %d: the next triple peak occurs in %d days.\n",counts,num);
        }
    }
}

中国剩余定理模板如下:

int extgcd(int a,int b,int& x,int& y)
{
    int d=a;
    if(b!=0){
        d=extgcd(b,a%b,y,x);
        y-=(a/b)*x;
    }
    else{
        x=1,y=0;
    }
    return d;
}
int GRT(int a[],int m[],int n)
{
    int M=1;
    for(int i=0;i<n;i++)
        M*=m[i];
    int ret=0;
    for(int i=0;i<n;i++){
        int x,y;
        int tm=M/m[i];
        extgcd(tm,m[i],x,y);
        ret=(ret+tm*x*a[i])%M;
    }
    return (ret+M)%M;
}


poj1006 Biorhythms 边界,坑题

Biorhythms Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 125633   A...
  • EventQueue
  • EventQueue
  • 2016-03-17 21:14:07
  • 2010

POJ-1006-Biorhythms(中国剩余定理)

现设 num 是下一个相同日子距离开始的天数          p,e,i,d 如题中所设! 那么就可以得到三个式子:( num + d ) % 23 == p; ( num + d ) ...
  • u013476556
  • u013476556
  • 2014-08-06 14:40:52
  • 404

acm-Biorhythms(poj1006)同余

Biorhythms Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 112921   A...
  • absurd1350
  • absurd1350
  • 2014-08-07 16:09:30
  • 429

POJ1006 Biorhythms(生理周期,中国剩余定理详述)

Description   人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的...
  • SimonCoder
  • SimonCoder
  • 2015-11-16 08:56:59
  • 1369

北大ACM1006——Biorhythms~~中国剩余定理

中国剩余定理,百度一下,就有它的定义与证明。 这里我就讲一个例子就好了。 题目的意思就是给你p,e,i,d。(n + d)% 23 = p,(n + d) % 28 = e,(n + d) % 33 ...
  • qq_25425023
  • qq_25425023
  • 2015-06-14 09:39:44
  • 879

PKU ACM-1006题 java Biorhythms

 从现在开始写报告吧!不能只贴代码了。这题是典型的中国剩余定理(孙子定理)题。具体(百度搜索下~)根据题意其实就是一个数被23整除余数是Lp=p % 23(p被23整除的余数),被28整除余数是Le=...
  • BXFTYT
  • BXFTYT
  • 2011-02-27 02:22:00
  • 841

POJ 1006 源代码——中国剩余定理分析

  • 2011年02月27日 22:00
  • 724B
  • 下载

pku 1006

#include using namespace std;int main(){ int p,e,i,d, result; int n = 0; while(scanf("%d%d%d%d",&p, ...
  • xiaofengsheng
  • xiaofengsheng
  • 2009-02-25 12:47:00
  • 706

北大ACM1006报WrongAnswer解决思路

在1002题之后,后面的1003到1005实在太过简单,所以就不单独发博文阐述了,有问题可以在评论下面回复。 我们详细讨论一下1006题,题目的大致意思大概是找一个公倍数的问题,也就是这三个数在什么...
  • qq_30892795
  • qq_30892795
  • 2017-05-26 08:49:30
  • 301

1006:Biorhythms

#include using namespace std; int main() {  int p,e,i,d,t=1;     while(cin>>p>>e>>i>>d)  {  ...
  • yanjiahong01
  • yanjiahong01
  • 2013-09-26 15:04:41
  • 351
收藏助手
不良信息举报
您举报文章:Biorhythms (poj 1006)
举报原因:
原因补充:

(最多只允许输入30个字)