分析:中国剩余定理(注意结果要大于d即可)
代码：
#include<iostream>
#include<cstdio>
using namespace std;
int n1, n2, n3, n;
void solve() {
n1 = *;
while(n1% != ) n1 += *;
n2 = *;
while(n2% != ) n2 += *;
n3 = *;
while(n3% != ) n3 += *;
n = **;
}
int main() {
int Case = ;
solve();
while() {
int p, e, i, d;
scanf("%d%d%d%d", &p, &e, &i, &d);
if(p == - && e == - && i == - && d == -) break;
int ans = (n1*p+n2*e+n3*i)%n;
while(ans <= d) ans += n;
printf("Case %d: the next triple peak occurs in %d days.\n", Case++, ans-d);
}
return ;
}