中国剩余定理

数论好难

感觉自己数论只能记个结论（甚至结论都记不住。

定义

如果有
$xmod{m}_1=a_{1}mod{m}_1$
$xmod{m}_2=a_{2}mod{m}_2$
$xmod{m}_3=a_{3}mod{m}_3$
$......$
$xmod{m}_n=a_{n}mod{m}_n$

$m_1,m_2......m_n$两两互素，$M=m_1\times m_2\times ...\times m_n$。那么存在解$x=(a_1\times M_1\times M_1^{-1}+a_2\times M_2\times M_2^{-1}+......+a_i\times M_i\times M_i^{-1})modM$

其中$M_i=M/m_i$，$M_i^{-1}为M_i关于模m_i的逆元$

练习题

AC代码：

/*
 * @Author: hesorchen
 * @Date: 2020-07-02 22:19:34
 * @LastEditTime: 2020-07-03 23:04:14
 * @Description: https://hesorchen.github.io/
 */
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define endl '\n'
#define PI acos(-1)
#define PB push_back
#define ll long long
#define INF 0x3f3f3f3f
#define mod 10007
#define pll pair<ll, ll>
#define lowbit(abcd) (abcd & (-abcd))
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))

#define IOS                      \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0);
#define FRE                              \
    {                                    \
        freopen("in.txt", "r", stdin);   \
        freopen("out.txt", "w", stdout); \
    }

inline ll read()
{
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
//==============================================================================

void exgcd(ll a, ll b, ll &x, ll &y)
{
    if (!b)
    {
        x = 1;
        y = 0;
        return;
    }
    exgcd(b, a % b, x, y);
    ll temp = x;
    x = y;
    y = temp - (a / b) * y;
}

int main()
{
    ll a[5], m[5], d, t = 1;
    m[1] = 23, m[2] = 28, m[3] = 33;

    while (cin >> a[1] >> a[2] >> a[3] >> d)
    {
        if (a[1] == a[2] && a[2] == a[3] && a[3] == d && d == -1)
            break;

        ll M = m[1] * m[2] * m[3], ans = 0, x, y, temp;

        temp = M / m[1];
        exgcd(temp, m[1], x, y);
        ans += a[1] * temp * x % M;

        temp = M / m[2];
        exgcd(temp, m[2], x, y);
        ans += a[2] * temp * x % M;

        temp = M / m[3];
        exgcd(temp, m[3], x, y);
        ans += a[3] * temp * x % M;

        ans -= d;
        ans = (ans + M) % M;
        if (ans == 0)
            ans = M;
        cout << "Case " << t++ << ": the next triple peak occurs in " << ans << " days." << endl;
    }
    return 0;
}

参考资料：

1. poj 1006 与 中国剩余定理
2. 中国剩余定理