zoj1160 Biorhythms

1. //zoj1160 Biorhythms
2. //Accepted 1160 C ++ 00:00.02 396K
3. /*
4. Chinese remainder theorem
5. a1 = p, a2 = e, a3 = i
6. m1 = 23, m2 = 28, m3 = 33
7. m = m1*m2*m3 = 23*28*23 = 21252
8. M1 = m/m1 = 28*33, M2 = m/m2 = 23*33, M3 = m/m3 = 23*28
9. y1 = M1(mod m1) = 6, y2 = M2(mod m2) = 19, y3 = M3(mod m2) = 2
10. x = a1*M1*y1+a2*M2*y2+a3*M3*y3 (mod m)
11. */
12. #include <stdio.h>
13. int main()
14. {
15. #ifdef ONLINE_JUDGE
16. #else
17.        freopen("1160.txt","r",stdin);
18. #endif
19.        int p,e,i,d,x;
20.        int test;
21.        while (scanf ("%d",&test) != EOF) {
22.               while (test--) {
23.                      int cnt = 1;
24.                      while (scanf ("%d %d %d %d",&p,&e,&i,&d) != EOF) {
25.                             if (p == -1) break;
26.                             x = (p*6*28*33+e*19*23*33+i*2*23*28)%21252;
27.                             x -= d;
28.                             if (x <= 0 ) x += 21252;
29.                             printf ("Case %d: the next triple peak occurs in %d days./n",cnt++,x);
30.                      }
31.                      if (test) printf ("/n");
32.               }
33.        }
34. #ifdef ONLINE_JUDGE
35. #else
36.        fclose(stdin);
37. #endif
38.        return 0;
39. }
40.