hdu 5478 Can you find it（数论）

题目链接：hdu 5478 Can you find it

解题思路

当n=1时，$a^{k_1+b_1} + b^{k_2} = 0 (mod C)$
所以枚举a，既有唯一与之对应的b，$a + b = C$
已知所有的

$$a_i + b_i = 0 (mod C)$$
$$a_i (mod C) + b_i(mod C) = C$$

当n > 1时

$$a^{k_1} * a_{n-1} + b^{k_2} * b_{n-1} = 0 (mod C)$$
$$a^{k_1} * (C - b_{n-1}(mod C)) + b^{k_2} * b_{n-1} = 0 (mod C)$$
$$a^{k_1} * C + (-a^{k_1} + b^{k_2}) * b_{n-1} = 0 (mod C)$$
显然 $a^{k_1} * C = 0 (mod C)$，所以只要再判断 $(-a^{k_1} + b^{k_2}) = 0 (mod C)$即可，也就是判断一下n=2的时候满不满足就行了。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long ll;

ll pow_mod (ll x, int n, int mod) {
    ll ret = 1;
    while (n) {
        if (n&1) ret = ret * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return ret;
}

int main () {
    int cas = 1, C, k1, b1, k2;
    while (scanf("%d%d%d%d", &C, &k1, &b1, &k2) == 4) {
        printf("Case #%d:\n", cas++);

        int cnt = 0;
        for (int a = 1; a < C; a++) {
            int b = C - pow_mod(a, k1+b1, C);
            if ((pow_mod(a, k1, C) * (C - b) % C + pow_mod(b, k2, C) * b % C) % C == 0) {
                printf("%d %d\n", a, b);
                cnt++;
            }
        }

        if (cnt == 0)
            printf("-1\n");
    }
    return 0;
}