解题报告:
核心思想就是取余,但是要注意答案小于21252,但是减去初始天数之前的那个“日期”是没有这个限制的。
公式:绝对值(“日期”-“某项第一次高峰”) MOD “某项周期长度” == 0;
注意:OpenJudge不认识abs()函数,需要include<cstdlib>。cmath和math.h都不行,会CE。
AC代码:
#include <iostream>
#include <cstdlib>
using namespace std;
const int PC = 23;
const int EC = 28;
const int IC = 33;
const int MAXRES = 22000;
int main()
{
int i;
int cnt = 0;
int PPeak, EPeak, IPeak, SDay;
while(cin >> PPeak >> EPeak >> IPeak >> SDay)
{
cnt++;
if(PPeak < 0) break;
for(i = SDay + 1; i != MAXRES; ++i)
{
if(abs(i - PPeak) % PC != 0) continue;
if(abs(i - EPeak) % EC != 0) continue;
if(abs(i - IPeak) % IC != 0) continue;
cout << "Case " << cnt
<< ": the next triple peak occurs in "
<< i - SDay << " days." << endl;
break;
}
}
return 0;
}