AcWing 1309. 车的放置
原题链接
中等
作者:
清风qwq
,
2022-07-07 10:07:09
,
所有人可见
,
阅读 133
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 5010, P = 100003;
int mul[N], divi[N];
int FastPower(int a, int b)
{
if (b == 1)return a;
int t = FastPower(a, b / 2);
if (b & 1)return (LL)t * t % P * a % P;
return (LL)t * t % P;
}
int A(int a, int b)
{
if (a < b)return 0;
return (LL)mul[a] * divi[a - b] % P;
}
int C(int a, int b)
{
if (a < b)return 0;
return (LL)mul[a] * divi[a - b] % P * divi[b] % P;
}
int T(int n, int m, int k)
{
return (LL)C(n, k) * A(m, k) % P;
}
int main()
{
int a, b, c, d, k;
cin >> a >> b >> c >> d >> k;
mul[0] = divi[0] = 1;
for (int i = 1; i < N; i ++ )
{
mul[i] = (LL)mul[i - 1] * i % P;
divi[i] = (LL)divi[i - 1] * FastPower(i, P - 2) % P;
}
LL res = 0;
for (int i = 0; i <= k; i ++ )
res = (res + (LL)T(a, b, i) * T(a + c - i, d, k - i) % P) % P;
printf("%d", res);
return 0;
}