https://codeforces.com/contest/1778/problem/D
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
/*
f[i] : i 个不同的期望步数
f[i] = 1 + i/n*f[i - 1] + (n - i)/n*f[i + 1]
因f[0] = 0, f[n] = 1 + f[i - 1],所以通过递推可以得到所有f[i]
把f[i] 写成 f[i] = a + b * f[i + 1] 的形式进行递推
*/
ll mod = 998244353;
ll qpow(ll base, ll pow)
{
ll ans = 1;
while (pow)
{
if (pow & 1)
ans = ans * base % mod;
pow >>= 1;
base = base * base % mod;
}
return ans;
}
inline ll inv(ll x){
return qpow(x, mod - 2);
}
void solve()
{
int n;
cin >> n;
string s1, s2;
cin >> s1 >> s2;
int k = 0;
for(int i = 0; i < n; i++) k += (s1[i] != s2[i]);
vector<ll> a(n + 1), b(n + 1);
for(int i = 1; i <= n; i++)
{
ll l = i * inv(n) % mod;
ll r = (n - i) * inv(n) % mod;
ll t = inv(1 - l * b[i - 1] % mod + mod);
a[i] = (1 + l * a[i - 1] % mod) % mod * t % mod;
b[i] = r * t % mod;
}
vector<ll> f(n + 1);
f[n] = a[n];
for(int i = n - 1; i >= k; i--) f[i] = (a[i] + b[i] * f[i + 1] % mod) % mod;
cout << f[k] << '\n';
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
Flexible String Revisit(期望dp,一次函数递推)
最新推荐文章于 2024-10-11 12:01:25 发布