之前忘了写题解了,贴个代码吧。。
// #pragma GCC optimize(2)
// #include <random>
// #include <windows.h>
// #include <ctime>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define IO \
ios::sync_with_stdio(false); \
// cout.tie(0);
#define lson(x) (x << 1)
#define rson(x) (x << 1 | 1)
using namespace std;
// int dis[8][2] = {0, 1, 1, 0, 0, -1, -1, 0, 1, -1, 1, 1, -1, 1, -1, -1};
typedef unsigned long long ULL;
typedef long long LL;
typedef pair<int, int> P;
const int maxn = 2e5 + 10;
const int maxm = 1e7 + 10;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int dis[4][2] = {1, 0, 0, -1, 0, 1, -1, 0};
// int m[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
char a[maxn];
char b[maxn];
LL vis[26];
LL c[maxn];
LL inv[maxn];
LL INV[maxn];
int main()
{
#ifdef WXY
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
// IO;
int T, n;
cin >> n;
c[0] = 1;
c[1] = 1;
inv[0] = 1;
inv[1] = 1;
INV[0] = INV[1] = 1;
for (int i = 2; i <= n; i++)
{
inv[i] = mod - mod / i * inv[mod % i] % mod;
INV[i] = INV[i - 1] * inv[i] % mod;
c[i] = c[i - 1] * i % mod;
}
scanf("%s", a + 1);
scanf("%s", b + 1);
for (int i = 1; i <= n; i++)
{
int t = a[i] - 'A';
vis[t]++;
}
LL cnt1 = 0;
for (int i = 1; i <= n; i++)
{
LL tp = 0;
int s = 0;
int t = a[i] - 'A';
while (s < t)
{
if (vis[s] == 0)
{
s++;
continue;
}
LL tmp = c[n - i];
for (int j = 0; j < 26; j++)
{
if (vis[j] == 0)
continue;
if (j == s)
tmp = tmp * INV[vis[j] - 1] % mod;
else
tmp = tmp * INV[vis[j]] % mod;
}
s++;
tp = (tp + tmp) % mod;
}
cnt1 = (cnt1 + tp) % mod;
vis[a[i] - 'A']--;
}
memset(vis, 0, sizeof vis);
for (int i = 1; i <= n; i++)
a[i] = b[i];
for (int i = 1; i <= n; i++)
{
int t = a[i] - 'A';
vis[t]++;
}
LL cnt2 = 0;
for (int i = 1; i <= n; i++)
{
LL tp = 0;
int s = 0;
int t = a[i] - 'A';
while (s < t)
{
if (vis[s] == 0)
{
s++;
continue;
}
LL tmp = c[n - i];
for (int j = 0; j < 26; j++)
{
if (vis[j] == 0)
continue;
if (j == s)
tmp = tmp * INV[vis[j] - 1] % mod;
else
tmp = tmp * INV[vis[j]] % mod;
}
s++;
tp = (tp + tmp) % mod;
}
cnt2 = (cnt2 + tp) % mod;
vis[a[i] - 'A']--;
}
cout << (cnt1 - cnt2 + mod) % mod;
return 0;
}