POJ 1006 Biorhythms（中国剩余定理）

题目链接：
POJ 1006 Biorhythms

中国剩余定理

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const int M = 3;

int cases = 0, a0, m0, dd;
int a[3], m[3] = {23, 28, 33};


int ex_gcd(int aa, int bb, int& x, int& y)
{
    if(bb == 0){
        x = 1, y = 0;
        return aa;
    }
    int d = ex_gcd(bb, aa % bb, y, x);
    y -= aa / bb * x;
    return d;
}

void work(int& m0, int& a0, int mm, int aa)
{
    int x, y, d;
    d = ex_gcd(m0, mm, x, y);
    mm /= d;
    x = x * (aa - a0) / d % mm;
    a0 += x * m0;
    m0 *= mm;
    a0 = (a0 % m0 + m0) % m0;
}

void solve()
{
    m0 = 1, a0 = 0;
    for(int i = 0; i < M; i++){
        work(m0, a0, m[i], a[i]);
    }
}

int main()
{
    while(~scanf("%d%d%d%d", &a[0], &a[1], &a[2], &dd) &&(a[0] != -1)){
        for(int i = 0; i < M; i++){
            a[i] %= m[i];
        }
        solve();
        a0 = ((a0 - dd) % m0 + m0) % m0;
        if(a0 == 0) a0 = m0;
        printf("Case %d: the next triple peak occurs in %d days.\n", ++cases, a0);
    }
    return 0;
}