Submission #408287
Source Code Expand
from functools import reduce from operator import mul N, K = map(int, input().split()) combi = lambda i, j: reduce(mul, range(i, i - j, -1)) // reduce(mul, range(j, 0, -1)) if j > 0 else 1 res = combi(N + K - 1, K) if N > K else combi(N, K % N) print(res % 1000000007)
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | yumechi |
Language | Python (3.4.2) |
Score | 100 |
Code Size | 279 Byte |
Status | AC |
Exec Time | 115 ms |
Memory | 7500 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 20 / 20 | ||||||
Status |
|
|
|
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 | 115 ms | 7444 KB |
subtask0_sample_02.txt | AC | 113 ms | 7424 KB |
subtask0_sample_03.txt | AC | 112 ms | 7452 KB |
subtask1_01.txt | AC | 112 ms | 7456 KB |
subtask1_02.txt | AC | 114 ms | 7364 KB |
subtask1_03.txt | AC | 113 ms | 7452 KB |
subtask1_04.txt | AC | 113 ms | 7500 KB |
subtask1_05.txt | AC | 111 ms | 7456 KB |
subtask1_06.txt | AC | 111 ms | 7456 KB |
subtask1_07.txt | AC | 113 ms | 7456 KB |
subtask1_08.txt | AC | 112 ms | 7452 KB |
subtask1_09.txt | AC | 111 ms | 7456 KB |
subtask1_10.txt | AC | 115 ms | 7452 KB |
subtask1_11.txt | AC | 114 ms | 7488 KB |
subtask1_12.txt | AC | 111 ms | 7456 KB |
subtask1_13.txt | AC | 112 ms | 7456 KB |
subtask1_14.txt | AC | 113 ms | 7456 KB |
subtask1_15.txt | AC | 112 ms | 7456 KB |
subtask1_16.txt | AC | 111 ms | 7452 KB |
subtask1_17.txt | AC | 111 ms | 7460 KB |
subtask1_18.txt | AC | 112 ms | 7468 KB |
subtask1_19.txt | AC | 111 ms | 7456 KB |
subtask2_01.txt | AC | 111 ms | 7456 KB |
subtask2_02.txt | AC | 111 ms | 7452 KB |
subtask2_03.txt | AC | 111 ms | 7452 KB |
subtask2_04.txt | AC | 112 ms | 7456 KB |
subtask2_05.txt | AC | 112 ms | 7440 KB |
subtask2_06.txt | AC | 110 ms | 7452 KB |
subtask2_07.txt | AC | 112 ms | 7428 KB |
subtask2_08.txt | AC | 112 ms | 7456 KB |
subtask2_09.txt | AC | 111 ms | 7456 KB |
subtask2_10.txt | AC | 112 ms | 7456 KB |
subtask2_11.txt | AC | 111 ms | 7456 KB |