Code:

#include <iostream>
using namespace std;

int main()
{
    int p, e, i, d, ans;
    int icase = 1;
    while(icase)
    {
        cin >> p >> e >> i >> d;
	if(p == -1 && e == -1 && e == -1 && d == -1) 
      	    break;
      	ans = (5544 * p + 14421 * e + 1288 * i ) % (23 * 28 * 33) - d;
	while (ans <= 0) 
	    ans += 21252;
	cout << "Case " << icase << ": the next triple peak occurs in " << ans << " days." << endl;		
	icase ++;
    }
    return 0;
}

• Re:用孙子定理做 还94MS...求解 (15) yc5_yc 2012-06-09 20:07:10
  • Re:用孙子定理做 还94MS...求解 (48) Super_Sword 2012-07-05 15:52:41
    • Re:用孙子定理做 还94MS...求解 (6) D_e_n_g 2012-07-31 10:48:42