Monica with her kids!!
All submissions for this problem are available.It's summertime and Monica has made a lot of blueberry jam with plans to make delicious sandwiches for her kids - Erica, Jack, Phoebe, Daniel and of course Joey. Being the organizational freak that she is, Monica filled the jam into jars and then divided them into $B$ boxes such that every box had n jars labeled with numbers from $1$ to $n$. Monica remembered what had happened the last time and didn't want Joey to finish all the jam by himself again - so she told him, that he could only have the $j$$th$ jar from the $i$$th$ box if he's had a jar labeled with any of the divisors of $j$ from the $(i−1)$$th$ box. This statement made Joey dizzy and since Chandler is in Yemen(the country), on an advertising company meet up, he needs your help. Joey feels Monica tricked him and there are no jars of jam he is allowed to eat, so you have to tell him in how many ways he can go from box $1$ to jar $k$ in box $n$. Hurry before hungry Joey gets cranky! ###Constraints - $1\leq B \leq1000000000$ - $1\leq n \leq100$ - $1\leq k \leq n$ ###Input - The $1$$st$ and the only line of input contains $3$ numbers: $n$, $B$ and $k$. ###Output There will be a single output which contains the number of ways you can go from box $1$ to jar $k$ in box $n$. Print the $(ans)$$modulo$$(1000000007)$. ###Sample Input 5 3 4 ###Sample Output 6 ###Explanation: The jar allotted is jar $4$ of the $3$$rd$ box, so the combinations of jars he can eat are : $(1,1,4), (1,2,4), (2,2,4), (1,4,4), (2,4,4), (4,4,4).$
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions