zoukankan      html  css  js  c++  java
  • poj 1006 Biorhythms

    Biorhythms
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 117289   Accepted: 36793

    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

    中国剩余定理

    学习文章:http://www.cnblogs.com/walker01/archive/2010/01/23/1654880.html

     1 #include<iostream>
     2 using namespace std;
     3 int gcd(int a,int b){
     4     if(b==0){
     5         return a;
     6     }
     7     return gcd(b,a%b);
     8 }
     9 void find(int a,int b,int c){//
    10     int t,l;
    11     l=b*c/gcd(b,c);
    12     t=1;
    13     while(t*l%a!=1){
    14         t++;
    15     }
    16     cout<<a<<" "<<t*l<<endl;
    17 }
    18 int main()//23, 28, and 33
    19 {
    20     int p,e,i,d;
    21     int time=1;
    22     //find(23,28,33);//23 5544
    23     //find(28,33,23);//28 14421
    24     //find(33,23,28);//33 1288
    25     while(cin>>p>>e>>i>>d)
    26     {
    27         if(p==-1 && e==-1 && i==-1 && d==-1)
    28             break;
    29         int lcm=21252;  // lcm(23,28,33)
    30         int n=(5544*p+14421*e+1288*i-d+21252)%21252;
    31         if(n==0)
    32             n=21252;
    33         cout<<"Case "<<time++<<": the next triple peak occurs in "<<n<<" days."<<endl;
    34     }
    35     return 0;
    36 }
  • 相关阅读:
    张艾迪(创始人):AOOOiA.global因梦想而诞生
    openx中如何使用site-variable(参数)限制(关键词)广告显示
    那些支持图片外链的免费相册
    php获取html纯文本,解决编辑器手动键入空格造成的无意义空白字符(空值问题)
    ios7迎来完美越狱,果粉狂欢!
    如何记录搜索引擎爬行记录php版
    购物返现网址大全
    jquery .post .get中文参数乱码解决方法详解
    【BUG】wego购物分享系统未登陆分享宝贝时查看宝贝自动新增产品数据
    让wego微购购物分享系统采集拍拍数据功能之腾讯paipai功能采集插件
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4299098.html
Copyright © 2011-2022 走看看