Submission #65685484

Source Code Expand

P = 998244353
nn = 4001001

fa = [1] * (nn + 1)
fainv = [1] * (nn + 1)
for i in range(nn):
    fa[i+1] = fa[i] * (i + 1) % P
fainv[-1] = pow(fa[-1], P - 2, P)
for i in range(nn)[::-1]:
    fainv[i] = fainv[i+1] * (i + 1) % P

C = lambda a, b: fa[a] * fainv[b] % P * fainv[a-b] % P if 0 <= b <= a else 0


a, b, c, d = map(int, input().split())
n = a + b + c + d
ans = 0
for i in range(a, min(a + b + 1, n - c)):
    ans = (ans + C(i - 1, a - 1) * C(n - i, c)) % P
print(ans)

Submission Info

Submission Time
Task E - Fruit Lineup
User Kiri8128
Language Python (PyPy 3.10-v7.3.12)
Score 475
Code Size 493 Byte
Status AC
Exec Time 144 ms
Memory 146500 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 475 / 475
Status
AC × 3
AC × 17
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 02_max_00.txt, 02_max_01.txt, 02_max_02.txt, 02_max_03.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 131 ms 143448 KiB
00_sample_01.txt AC 132 ms 143796 KiB
00_sample_02.txt AC 135 ms 143820 KiB
01_random_00.txt AC 137 ms 143880 KiB
01_random_01.txt AC 141 ms 144132 KiB
01_random_02.txt AC 138 ms 144052 KiB
01_random_03.txt AC 137 ms 146116 KiB
01_random_04.txt AC 135 ms 143640 KiB
01_random_05.txt AC 141 ms 143768 KiB
01_random_06.txt AC 141 ms 143708 KiB
01_random_07.txt AC 139 ms 145852 KiB
01_random_08.txt AC 142 ms 145464 KiB
01_random_09.txt AC 138 ms 146500 KiB
02_max_00.txt AC 143 ms 143892 KiB
02_max_01.txt AC 144 ms 143572 KiB
02_max_02.txt AC 142 ms 143760 KiB
02_max_03.txt AC 143 ms 143520 KiB