Submission #783670


Source Code Expand

MOD = 1000000007
 
def ncr(n, r):
    if n - r < r:
        r = n-r
    if r == 0:
        return 1
    if r == 1:
        return n
 
    numerator = [0 for i in range(r)]
    denominator = [0 for i in range(r)]
 
    for k in range(r):
        numerator[k] = n - r + k + 1
        denominator[k] = k + 1
    
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
        for k in range(p-1, r, p):
            numerator[k-offset] /= pivot
            denominator[k] /= pivot
 
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result = (result*numerator[k]) % MOD
 
    return result

N, K = map(int, raw_input().split())
print ncr(N, K%N)

Submission Info

Submission Time
Task B - 高橋幼稚園
User nebukuro09
Language Python (2.7.3)
Score 80
Code Size 762 Byte
Status WA
Exec Time 58 ms
Memory 3384 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 80 / 80 0 / 20
Status
AC × 2
WA × 1
AC × 21
AC × 22
WA × 11
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.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 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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_01.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, subtask2_11.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 54 ms 3368 KB
subtask0_sample_02.txt AC 54 ms 3372 KB
subtask0_sample_03.txt WA 56 ms 3372 KB
subtask1_01.txt AC 53 ms 3364 KB
subtask1_02.txt AC 55 ms 3376 KB
subtask1_03.txt AC 54 ms 3380 KB
subtask1_04.txt AC 54 ms 3376 KB
subtask1_05.txt AC 53 ms 3364 KB
subtask1_06.txt AC 55 ms 3376 KB
subtask1_07.txt AC 53 ms 3372 KB
subtask1_08.txt AC 53 ms 3372 KB
subtask1_09.txt AC 54 ms 3376 KB
subtask1_10.txt AC 53 ms 3296 KB
subtask1_11.txt AC 53 ms 3376 KB
subtask1_12.txt AC 53 ms 3368 KB
subtask1_13.txt AC 53 ms 3376 KB
subtask1_14.txt AC 54 ms 3368 KB
subtask1_15.txt AC 55 ms 3368 KB
subtask1_16.txt AC 55 ms 3372 KB
subtask1_17.txt AC 56 ms 3372 KB
subtask1_18.txt AC 56 ms 3376 KB
subtask1_19.txt AC 56 ms 3372 KB
subtask2_01.txt WA 57 ms 3368 KB
subtask2_02.txt WA 57 ms 3376 KB
subtask2_03.txt WA 56 ms 3372 KB
subtask2_04.txt WA 58 ms 3368 KB
subtask2_05.txt WA 57 ms 3372 KB
subtask2_06.txt WA 54 ms 3380 KB
subtask2_07.txt WA 56 ms 3384 KB
subtask2_08.txt WA 56 ms 3368 KB
subtask2_09.txt WA 55 ms 3364 KB
subtask2_10.txt WA 55 ms 3372 KB
subtask2_11.txt AC 54 ms 3376 KB