POJ 1006

来源:互联网 发布:河北省网络直报平台 编辑:程序博客网 时间:2024/06/03 14:42
#include<iostream>using namespace std;int main(){    int p,e,i,d,date;    int cas = 0;    while (cin>>p>>e>>i>>d )    {        if(p == -1 && e == -1 && i == -1 && d == -1 )            break;         date = d;         ++d;        while ((d - p) % 23 != 0)        {            ++d;        }        while ((d - e) % 28 != 0 || (d - i)%33 != 0)        {            d += 23;        }        cout<<"Case "<<++cas<<": the next triple peak occurs in "<<d - date<<" days."<<endl;            }    return 0;    }

0 0
原创粉丝点击