POJ 1006 中国剩余定理

 #include <cstdio>
 int main()
 {
 //    freopen("in.txt","r",stdin);
     int p,e,i,d,kase=;
     while(scanf("%d%d%d%d",&p,&e,&i,&d))
     {
         if(p==- && e == - && i == - && d== -) break;
         const int m1 = ,m2 = ,m3 = ;
         const int M1 = m2*m3, M2 = m1*m3, M3 = m1*m2;
         const  int m11 = ,m22=,m33=;
         const int M =m1*m2*m3;
         int x = p*m11*M1 + e * m22*M2 + i * m33*M3;
         x = (x+M)%M;
         if(x-d <=  )
             printf("Case %d: the next triple peak occurs in %d days.\n",++kase,x-d+M);
         else printf("Case %d: the next triple peak occurs in %d days.\n",++kase,x-d);
     }
     return ;
 }

首先了解中国剩余定理，根据扩展欧几里得定理求出M1‘，M2'和M3’的正整数解分别为6,19,2。。。直接算的话M2‘为-9，但是要是正整数解，所以可以用-9+28 = 19.

下面介绍一下中国剩余定理，又叫孙子定理。

若m1,m2,```,mk为两两互质的k个整数，有数x%mi = bi(1<=i<=k).bi已知，求x的解

令M = m1*m2*```*mk,Mi = M/mi```Mi'为满足(Mi'Mi)%mi = 1的正整数解···

x = sum(bi*Mi' * Mi)%M````

验证x是解，用x%mi = bi```，然后证明x是唯一解，假设y也是解，得到x = y%M...所以x就是全部的解了·····

不明白还可以去看下面的链接：

http://www.cnblogs.com/walker01/archive/2010/01/23/1654880.html