Submission #73542701

Source Code Expand

MOD = 10**9+7
def solve(N,K):
    K = min(K,N-K)
    A = 1
    B = 1
    for i in range(1,K+1):
        A = A*(N-K+i)%MOD
        B = B*i%MOD
    return A*pow(B,MOD-2,MOD)%MOD
N,M = map(int,input().split())
K = (N+2)//2
L = (N+1)//2
print((solve(M+K,K) * solve(M+L,L) - solve(M+K-1,K) * solve(M+L-1,L)) % MOD)

Submission Info

Submission Time
Task D - cresc.
User glaceon1020
Language Python (PyPy 3.11-v7.3.20)
Score 600
Code Size 321 Byte
Status AC
Exec Time 174 ms
Memory 85592 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 20
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, random-01.txt, random-02.txt, random-03.txt, random-04.txt, random-05.txt, random-06.txt, random-07.txt, random-08.txt, random-09.txt, random-10.txt, random-11.txt, random-12.txt, random-13.txt, random-14.txt, random-15.txt, random-16.txt, random-17.txt, random-18.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 66 ms 79940 KiB
00_sample_02.txt AC 78 ms 85328 KiB
random-01.txt AC 165 ms 85592 KiB
random-02.txt AC 174 ms 85524 KiB
random-03.txt AC 165 ms 85556 KiB
random-04.txt AC 166 ms 85408 KiB
random-05.txt AC 163 ms 85408 KiB
random-06.txt AC 152 ms 85220 KiB
random-07.txt AC 167 ms 85344 KiB
random-08.txt AC 164 ms 85140 KiB
random-09.txt AC 64 ms 79816 KiB
random-10.txt AC 65 ms 79796 KiB
random-11.txt AC 67 ms 79744 KiB
random-12.txt AC 67 ms 79900 KiB
random-13.txt AC 63 ms 79796 KiB
random-14.txt AC 61 ms 79832 KiB
random-15.txt AC 64 ms 79940 KiB
random-16.txt AC 63 ms 79712 KiB
random-17.txt AC 62 ms 79932 KiB
random-18.txt AC 65 ms 79744 KiB