Submission #1734930
Source Code Expand
from collections import defaultdict, Counter from itertools import product, groupby, count, permutations, combinations from math import pi, sqrt from collections import deque from bisect import bisect, bisect_left, bisect_right INF = float("inf") MOD = 1000000007 class Combination: def __init__(self, n, mod): assert 0 < n self.mod = mod self.fact = [1] * (n + 1) self.inv = [1] * (n + 1) for i in range(1, len(self.fact)): self.fact[i] = (i * self.fact[i - 1]) % self.mod self.inv[i] = pow(self.fact[i], self.mod - 2, self.mod) def nCr(self, n, k): assert 0 < n < len(self.fact) and 0 <= k a = self.fact[n] b = (self.inv[k] * self.inv[n - k]) % self.mod return a * b % self.mod def main(): N, K = map(int, input().split()) comb = Combination(501, MOD) if N == K: print(1) elif N <= K: r = K % N print(comb.nCr(N, r)) else: print(0) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | MitI_7 |
Language | Python (3.4.3) |
Score | 80 |
Code Size | 1077 Byte |
Status | WA |
Exec Time | 33 ms |
Memory | 3828 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 0 / 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 | 33 ms | 3828 KB |
subtask0_sample_02.txt | AC | 23 ms | 3316 KB |
subtask0_sample_03.txt | WA | 23 ms | 3316 KB |
subtask1_01.txt | AC | 24 ms | 3316 KB |
subtask1_02.txt | AC | 23 ms | 3316 KB |
subtask1_03.txt | AC | 23 ms | 3316 KB |
subtask1_04.txt | AC | 23 ms | 3316 KB |
subtask1_05.txt | AC | 23 ms | 3316 KB |
subtask1_06.txt | AC | 23 ms | 3316 KB |
subtask1_07.txt | AC | 23 ms | 3316 KB |
subtask1_08.txt | AC | 23 ms | 3316 KB |
subtask1_09.txt | AC | 23 ms | 3316 KB |
subtask1_10.txt | AC | 23 ms | 3316 KB |
subtask1_11.txt | AC | 23 ms | 3316 KB |
subtask1_12.txt | AC | 23 ms | 3316 KB |
subtask1_13.txt | AC | 23 ms | 3316 KB |
subtask1_14.txt | AC | 23 ms | 3316 KB |
subtask1_15.txt | AC | 23 ms | 3316 KB |
subtask1_16.txt | AC | 23 ms | 3316 KB |
subtask1_17.txt | AC | 23 ms | 3316 KB |
subtask1_18.txt | AC | 23 ms | 3316 KB |
subtask1_19.txt | AC | 23 ms | 3316 KB |
subtask2_01.txt | WA | 24 ms | 3316 KB |
subtask2_02.txt | WA | 23 ms | 3316 KB |
subtask2_03.txt | WA | 23 ms | 3316 KB |
subtask2_04.txt | WA | 23 ms | 3316 KB |
subtask2_05.txt | WA | 23 ms | 3316 KB |
subtask2_06.txt | WA | 23 ms | 3316 KB |
subtask2_07.txt | WA | 23 ms | 3316 KB |
subtask2_08.txt | WA | 23 ms | 3316 KB |
subtask2_09.txt | WA | 23 ms | 3316 KB |
subtask2_10.txt | WA | 23 ms | 3316 KB |
subtask2_11.txt | WA | 23 ms | 3316 KB |