POJ1006A:细节不是骗局

#include <stdio.h>
#include <iostream>

using namespace std;

int main()
{
int count,j;
count=0;
int p,e,i,d;
int t;
while(cin>>p>>e>>i>>d)
{
if(p==-1&&e==-1&&i==-1&&d==-1)return 0;

if(p==e&&e==i)
{
p+=23;
e+=28;
i+=33;
}
while(p!=e||e!=i||p!=i)
{
if(p<e||p<i)p+=23;
if(e<i||e<p)e+=28;
if(i<p||i<e)i+=33;
}
int tmp=i-d;
if(tmp>21252)tmp=tmp%21252;
if(tmp<0)tmp+=21252;
printf("Case %d: the next triple peak occurs in %d days.\n",++count,tmp);
}
return 0;
}