牛客训练赛52

A
注意∏里面计算时i*n!=(i^n)*n!

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 bint;
const ll mod = 998244353;
const int maxn = 1e7 + 5;
ll qpow(ll a, ll b) {
    bint res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return (ll)res;
}
ll fact[maxn];
int main()
{
    //freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false); cin.tie(0);
    fact[1] = 1; for (int i = 2; i < maxn; ++i) fact[i] = i * fact[i - 1] % mod;
    int t; cin >> t;
    while (t--) {
        ll n; cin >> n;
        ll ans1 = n * (n + 1) % mod * qpow(2, mod - 2) % mod;
        ans1 = ans1 * ans1 % mod;
        ll ans2 = qpow(fact[n], 2 * n);
        cout << ans1 << " " << ans2 << '\n';
    }
}

B
开始以为是莫队模板题，交了发现应该是故意卡了莫队
考虑离线处理询问，以树状数组维护区间内单次出现值的和
以nxt[i] = j表示i位置的a[i]下一次出现在j位置。vis标记该位置是否是在序列内
每次删掉查询区间外的值并且把它的nxt加入树状数组

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
int a[maxn], pre[maxn], nxt[maxn];
struct BitTree {
    int n; ll val[maxn << 2];
    int lowbit(int x) { return x & (-x); }
    void update(int i, ll j) {
        while (i <= n) { val[i] += j; i += lowbit(i); }
    }
    ll query(int i) {
        ll res = 0;
        while (i) { res += val[i]; i -= lowbit(i); }
        return res;
    }
} bit;
struct node {
    int l, r, id;
    bool operator <(const node& ret) const {
        return l < ret.l;
    }
} q[maxn];
int vis[maxn]; ll ans[maxn];
int main()
{
    int n, m; scanf("%d%d", &n, &m);
    bit.n = n;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        if (pre[a[i]] != 0) nxt[pre[a[i]]] = i;
        else vis[i] = 1, bit.update(i, a[i]);
        pre[a[i]] = i;
    }
    for (int i = 1; i <= m; ++i) scanf("%d%d", &q[i].l, &q[i].r), q[i].id = i;
    sort(q + 1, q + m + 1); int l = 1;
    for (int i = 1; i <= m; ++i) {
        while (l < q[i].l) {
            if (vis[l]) bit.update(l, -a[l]), vis[l] = 0;
            if (nxt[l]) vis[nxt[l]] = 1, bit.update(nxt[l], a[nxt[l]]);
            l++;
        }
        ans[q[i].id] = bit.query(q[i].r);
    }
    for (int i = 1; i <= m; ++i) printf("%lld\n", ans[i]);
}

C
要能形成所有数字，选出的gcd(a1,a2…am)=1。问题即求gcd=1的方案数
dp[i][j]表示前i个数形成状态为j的方案数

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 3000 + 5;
int dp[maxn][2005];
int a[maxn];

int main()
{
	//freopen("in.txt", "r", stdin);
	int n; scanf("%d", &n);
	int mx = 0;
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		mx = max(mx, a[i]);
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= mx; ++j) 
			dp[i][j] = dp[i - 1][j] % mod;
		dp[i][a[i]]++;
		for (int j = 1; j <= mx; ++j)
			dp[i][__gcd(a[i], j)] = (dp[i][__gcd(a[i], j)] + dp[i - 1][j]) % mod;
	}
	printf("%d\n", dp[n][1]);
}