EOJ Monthly 2021.9 Sponsored by TuSimple——A.Amazing.Discovery（分治or二次剩余）

EOJ Monthly 2021.9 Sponsored by TuSimple

A.Amazing.Discovery

题意：

给出$a，b，n$，求
$$S=(a+\sqrt{b}{)}^n+(a-\sqrt{b}{)}^n(modp)$$

思路：

因为$\sqrt{b}$可能在模$mod$的情况下没有整数解。

解法1：

设$S_n=(a+\sqrt{b}{)}^n+(a-\sqrt{b}{)}^n$

则$S_{2n}=(a+\sqrt{b}{)}^{2n}+(a-\sqrt{b}{)}^{2n}=S_n^2-2(a+\sqrt{b}{)}^n(a-\sqrt{b}{)}^n=S_n^2-2(a^2-b{)}^n$

则$S_{2n+1}=(a+\sqrt{b}{)}^{2n+1}+(a-\sqrt{b}{)}^{2n+1}=S_n{S}_{n+1}-(a+\sqrt{b}{)}^n(a-\sqrt{b}{)}^{n+1}-(a+\sqrt{b}{)}^{n+1}(a-\sqrt{b}{)}^n=S_n^2-2a(a^2-b{)}^n$

分奇数和偶数往下进行分治(记忆化一下，减少算的次数)

#include <bits/stdc++.h>
#define lson rt << 1
#define rson (rt << 1) | 1

using namespace std;

typedef long long ll;
const int mod = 998244353;
ll qpow(ll x, ll y) {
    ll ans = 1;
    while(y) {
        if(y & 1) ans = ans * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return ans;
}
map<ll, ll> mp;
ll solve(ll a, ll b, ll n) {
    if(mp.find(n) != mp.end()) return mp[n];
    else if(n == 1) return mp[1] = 2ll*a;
    else {
        if(n % 2 == 0) {
            ll tmp = solve(a, b, n/2);
            return mp[n] = ((tmp * tmp % mod - 2ll * qpow((a*a%mod-b+mod)%mod, n/2) % mod) % mod + mod) % mod;
        }
        else {
            int k = n/2;
            ll tmp1 = solve(a, b, k), tmp2 = solve(a, b, n-k);
            return mp[n] = ((tmp1 * tmp2 % mod - 2ll * a % mod * qpow((a*a%mod-b+mod)%mod, n/2) % mod) % mod + mod) % mod;
        }
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    ll a, b, n;
    cin >> a >> b >> n;
    cout << solve(a, b, n); 

}

解法2：

二次剩余（简单理解）

用二次剩余$Cipolla$算法中的类似复数域的东西可以直接求解。

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int mod = 998244353;

ll a, b, n;
struct Y {
	ll x, y;
	Y operator * (const Y & u) {
		Y tmp; 
		tmp.x = (x * u.x % mod + y * u.y % mod * b % mod) % mod;
		tmp.y = (x * u.y % mod + y * u.x % mod) % mod;
		return tmp;
	}
	Y operator + (const Y & u) {
		Y tmp;
		tmp.x = (x + u.x) % mod;
		tmp.y = (y + u.y) % mod;
		return tmp;
	}
	
};
Y ksm(Y u, ll y) {
	Y ans = {1, 0};
	while(y) {
		if(y & 1) ans = ans * u;
		u = u * u;
		y >>= 1;
	}
	return ans;
}
int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif 
	Y x, y;
	cin >> a >> b >> n;
	a %= mod, b %= mod;
	x = {a, 1};
	y = {a, mod-1};
	x = ksm(x, n) + ksm(y, n);
	cout << ((x.x % mod) + mod) % mod << endl;
}