#include<iostream>
using namespace std;
int main()
{
int p,e,i,d,t=1;
while(cin>>p>>e>>i>>d)
{
int day=d+1;
if(p==-1&&e==-1&&i==-1&&d==-1)
break;
while(day-d<21252)
{
if( (day-p) % 23==0 && (day-e) % 28==0 && (day-i) % 33==0)
break;
else
day++;
}
cout<<"case "<< t++<<":"<<" the next triple peak occurs in "<<day-d<<" days"<<endl;
}
return 0;
}
答案没错 搞不清楚怎么wrong answer