Description
给出一个
x
和
n⩽1000,x⩽5000
Solution
可以发现这样一个性质如果
x
已经对
所以设
fi
表示当前
x
的值为
那么有以下转移
fi=min(fimodaj)|aj⩽i
gi=∑gimodaj×Ni!÷Nimodaj!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1005, maxm = 5005, mod = 998244353;
int n, m, a[maxn], fact[maxn], rfact[maxn], cnt[maxm], f[maxm], g[maxm];
inline int gi()
{
char c = getchar();
while(c < '0' || c > '9') c = getchar();
int sum = 0;
while('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int main()
{
freopen("alien.in", "r", stdin);
freopen("alien.out", "w", stdout);
n = gi(); m = gi();
for(int i = 1; i <= n; ++i) a[i] = gi();
sort(a + 1, a + n + 1);
fact[0] = 1;
for(int i = 1; i <= n; ++i) fact[i] = (ll)fact[i - 1] * i % mod;
rfact[1] = 1;
for(int i = 2; i <= n; ++i) rfact[i] = (ll)(mod - mod / i) * rfact[mod % i] % mod;
rfact[0] = 1;
for(int i = 2; i <= n; ++i) rfact[i] = (ll)rfact[i - 1] * rfact[i] % mod;
f[0] = 0; g[0] = 1;
for(int x = 1; x <= m; ++x) {
cnt[x] = cnt[x - 1];
while(cnt[x] < n && a[cnt[x] + 1] <= x) ++cnt[x];
if(cnt[x] == 0) {f[x] = x; g[x] = 1; continue;}
f[x] = 0; g[x] = 0;
for(int i = 1; i <= cnt[x]; ++i)
if(f[x] < f[x % a[i]]) f[x] = f[x % a[i]];
for(int i = 1; i <= cnt[x]; ++i)
if(f[x] == f[x % a[i]])
g[x] = (g[x] + (ll)g[x % a[i]] * fact[cnt[x] - 1] % mod * rfact[cnt[x % a[i]]] % mod) % mod;
}
printf("%d\n%lld\n", f[m], (ll)g[m] * fact[n] % mod * rfact[cnt[m]] % mod);
return 0;
}