Submission #405804
Source Code Expand
MOD = 1_000_000_007 n, k = gets.split.map(&:to_i) ans = 0 if n > k ans = (1..(n+k-1)).inject(:*) / ((1..(n-1)).inject(:*) * (1..k).inject(:*)) % MOD elsif n == k ans = 1 else r = k % n ans = ((n - r + 1)..n).inject(:*) / (1..r).inject(:*) % MOD end p ans
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | takuk |
Language | Ruby (2.1.5p273) |
Score | 0 |
Code Size | 285 Byte |
Status | RE |
Exec Time | 62 ms |
Memory | 5220 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 52 ms | 5100 KB |
subtask0_sample_02.txt | AC | 53 ms | 5096 KB |
subtask0_sample_03.txt | AC | 54 ms | 5076 KB |
subtask1_01.txt | RE | 52 ms | 5100 KB |
subtask1_02.txt | AC | 59 ms | 5084 KB |
subtask1_03.txt | AC | 58 ms | 5108 KB |
subtask1_04.txt | AC | 52 ms | 5140 KB |
subtask1_05.txt | AC | 53 ms | 5096 KB |
subtask1_06.txt | AC | 54 ms | 5100 KB |
subtask1_07.txt | AC | 54 ms | 5100 KB |
subtask1_08.txt | AC | 54 ms | 5100 KB |
subtask1_09.txt | AC | 55 ms | 5144 KB |
subtask1_10.txt | RE | 53 ms | 5100 KB |
subtask1_11.txt | AC | 51 ms | 5100 KB |
subtask1_12.txt | RE | 56 ms | 5164 KB |
subtask1_13.txt | AC | 53 ms | 5100 KB |
subtask1_14.txt | AC | 53 ms | 5100 KB |
subtask1_15.txt | AC | 53 ms | 5096 KB |
subtask1_16.txt | AC | 54 ms | 5100 KB |
subtask1_17.txt | RE | 55 ms | 5092 KB |
subtask1_18.txt | AC | 56 ms | 5088 KB |
subtask1_19.txt | RE | 62 ms | 5100 KB |
subtask2_01.txt | AC | 54 ms | 5096 KB |
subtask2_02.txt | AC | 54 ms | 5092 KB |
subtask2_03.txt | AC | 60 ms | 5100 KB |
subtask2_04.txt | AC | 52 ms | 5100 KB |
subtask2_05.txt | AC | 53 ms | 5096 KB |
subtask2_06.txt | AC | 55 ms | 5092 KB |
subtask2_07.txt | AC | 55 ms | 5096 KB |
subtask2_08.txt | AC | 54 ms | 5096 KB |
subtask2_09.txt | AC | 52 ms | 5100 KB |
subtask2_10.txt | AC | 54 ms | 5220 KB |
subtask2_11.txt | AC | 53 ms | 5100 KB |