链接
题解
写出生成函数
1
(
1
−
x
)
n
1
(
1
−
x
2
)
m
\frac{1}{(1-x)^n} \frac{1}{(1-x^2)^m}
(1−x)n1(1−x2)m1
这个题就是求它的 k k k次方项
给他分子分母同时乘以 ( 1 + x ) n (1+x)^n (1+x)n,就得到
1 ( 1 − x 2 ) n + m ( 1 + x ) n \frac{1}{(1-x^2)^{n+m}} (1+x)^n (1−x2)n+m1(1+x)n
1 ( 1 − x 2 ) n + m \frac{1}{(1-x^2)^{n+m}} (1−x2)n+m1用广义二项式定理展开,得到 ∑ k = 0 ∞ ( n + m − 1 + k k ) x 2 k \sum_{k=0}^\infin \binom{n+m-1+k}{k} x^{2k} ∑k=0∞(kn+m−1+k)x2k
枚举 ( 1 + x ) n (1+x)^n (1+x)n对答案有贡献的那一项,然后就可以对应找到前面多项式中的项
最后其实就是计算
∑
i
=
0
n
(
n
i
)
(
n
+
m
−
1
+
k
−
i
2
k
−
i
2
)
[
2
∣
(
k
−
i
)
]
\sum_{i=0}^n \binom{n}{i} \binom{n+m-1+\frac{k-i}{2}}{\frac{k-i}{2}} [2|(k-i)]
i=0∑n(in)(2k−in+m−1+2k−i)[2∣(k−i)]
后面那个组合数可以递推得到,最后时间复杂度 O ( n + m ) O(n+m) O(n+m)
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 2000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
struct EasyMath
{
ll prime[maxn], phi[maxn], mu[maxn];
bool mark[maxn];
ll fastpow(ll a, ll b, ll c)
{
ll t(a%c), ans(1ll);
for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
return ans;
}
void exgcd(ll a, ll b, ll &x, ll &y)
{
if(!b){x=1,y=0;return;}
ll xx, yy;
exgcd(b,a%b,xx,yy);
x=yy, y=xx-a/b*yy;
}
ll inv(ll x, ll p) //p是素数
{return fastpow(x%p,p-2,p);}
ll inv2(ll a, ll p)
{
ll x, y;
exgcd(a,p,x,y);
return (x+p)%p;
}
void shai(ll N)
{
ll i, j;
for(i=2;i<=N;i++)mark[i]=false;
*prime=0;
phi[1]=mu[1]=1;
for(i=2;i<=N;i++)
{
if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
for(j=1;j<=*prime and i*prime[j]<=N;j++)
{
mark[i*prime[j]]=true;
if(i%prime[j]==0)
{
phi[i*prime[j]]=phi[i]*prime[j];
break;
}
mu[i*prime[j]]=-mu[i];
phi[i*prime[j]]=phi[i]*(prime[j]-1);
}
}
}
ll CRT(vector<ll> a, vector<ll> m) //要求模数两两互质
{
ll M=1, ans=0, n=a.size(), i;
for(i=0;i<n;i++)M*=m[i];
for(i=0;i<n;i++)(ans+=a[i]*(M/m[i])%M*inv2(M/m[i],m[i]))%=M;
return ans;
}
}em;
#define mod 998244353ll
ll n, m, t, K, f[maxn], g[maxn], L, R;
ll q(ll x)
{
if(x<L or x>R)return 0;
return f[x-L];
}
int main()
{
ll i, j, ans=0;
n=read(), m=read(), K=read();
R=K/2;
L=max(0ll,(K-n)/2);
f[0]=1; t=n+m-1;
rep(i,1,t)(f[0]*=(t+L-i+1)%mod*em.inv(i,mod)%mod)%=mod;
rep(i,1,R-L)f[i]=f[i-1]*(t+L+i)%mod*em.inv(L+i,mod)%mod;
g[0]=1;
rep(i,1,n)g[i]=g[i-1]*(n-i+1)%mod*em.inv(i,mod)%mod;
rep(i,0,n)if((K-i)%2==0)(ans+=g[i]*q(K-i>>1))%=mod;
printf("%lld",(ans+mod)%mod);
return 0;
}