Submission #3003442


Source Code Expand

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

def Comb(n,k): #nCk
    gyakugen = [1]*(n+1)
    fac = [1]*(n+1)

    for i in range(1,n+1):
        fac[i] = (fac[i-1]*i)%mod

    gyakugen[n] = pow(fac[n],mod-2,mod)

    for i in range(n,0,-1):
        gyakugen[i-1] = (gyakugen[i]*i)%mod

    com = [1]*(n+1)

    for i in range(1,n+1):
        com[i] = (fac[n]*gyakugen[i]*gyakugen[n-i])%mod

    return com[k]

N = int(input())
k = int(input())

print(Comb(N+k-1,k))

Submission Info

Submission Time
Task D - 多重ループ
User simamumu
Language Python (3.4.3)
Score 100
Code Size 727 Byte
Status AC
Exec Time 172 ms
Memory 27916 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 99 / 99 1 / 1
Status
AC × 5
AC × 23
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 38 ms 4464 KB
subtask0_sample_02.txt AC 29 ms 4204 KB
subtask0_sample_03.txt AC 29 ms 4204 KB
subtask0_sample_04.txt AC 30 ms 4208 KB
subtask0_sample_05.txt AC 170 ms 27916 KB
subtask1_01.txt AC 29 ms 4204 KB
subtask1_02.txt AC 30 ms 4336 KB
subtask1_03.txt AC 29 ms 4208 KB
subtask1_04.txt AC 30 ms 4336 KB
subtask1_05.txt AC 29 ms 4336 KB
subtask1_06.txt AC 30 ms 4204 KB
subtask1_07.txt AC 30 ms 4332 KB
subtask1_08.txt AC 30 ms 4332 KB
subtask1_09.txt AC 30 ms 4332 KB
subtask1_10.txt AC 30 ms 4332 KB
subtask1_11.txt AC 30 ms 4332 KB
subtask1_12.txt AC 30 ms 4208 KB
subtask1_13.txt AC 30 ms 4332 KB
subtask1_14.txt AC 30 ms 4332 KB
subtask1_15.txt AC 30 ms 4332 KB
subtask1_16.txt AC 30 ms 4336 KB
subtask1_17.txt AC 30 ms 4336 KB
subtask1_18.txt AC 30 ms 4336 KB
subtask1_19.txt AC 30 ms 4340 KB
subtask2_02.txt AC 82 ms 13124 KB
subtask2_03.txt AC 120 ms 19380 KB
subtask2_04.txt AC 74 ms 11476 KB
subtask2_05.txt AC 142 ms 23200 KB
subtask2_06.txt AC 52 ms 7776 KB
subtask2_07.txt AC 100 ms 16064 KB
subtask2_08.txt AC 135 ms 21924 KB
subtask2_09.txt AC 100 ms 16060 KB
subtask2_10.txt AC 172 ms 27916 KB