@@ -0,0 +1,2202 @@
+/*%0AThe Grandest Staircase Of Them All%0A==================================%0AWith her LAMBCHOP doomsday device finished, Commander Lambda is preparing for her debut on the galactic stage - but in order %0Ato make a grand entrance, she needs a grand staircase! As her personal assistant, you've been tasked with figuring out how %0Ato build the best staircase EVER. %0A%0ALambda has given you an overview of the types of bricks available, plus a budget. You can buy different amounts of the %0Adifferent types of bricks (for example, 3 little pink bricks, or 5 blue lace bricks). Commander Lambda wants to know %0Ahow many different types of staircases can be built with each amount of bricks, so she can pick the one with the most options.%0A%0AEach type of staircase should consist of 2 or more steps.  No two steps are allowed to be at the same height - each step %0Amust be lower than the previous one. All steps must contain at least one brick. A step's height is classified as the total %0Aamount of bricks that make up that step.%0A%0AFor example, when N = 3, you have only 1 choice of how to build the staircase, with the first step having a height of 2 and %0Athe second step having a height of 1: (# indicates a brick)%0A%0A#%0A##%0A21%0AWhen N = 4, you still only have 1 staircase choice:%0A#%0A#%0A##%0A31%0A %0ABut when N = 5, there are two ways you can build a staircase from the given bricks. %0AThe two staircases can have heights (4, 1) or (3, 2), as shown below:%0A#%0A#%0A#%0A##%0A41%0A#%0A##%0A##%0A32%0AWrite a function called answer(n) that takes a positive integer n and returns the number of different staircases that can %0Abe built from exactly n bricks. n will always be at least 3 (so you can have a staircase at all), but no more than 200, %0Abecause Commander Lambda's not made of money!%0A%0ALanguages%0A=========%0ATo provide a Python solution, edit solution.py%0ATo provide a Java solution, edit solution.java%0ATest cases%0A==========%0AInputs:%0A    (int) n = 3%0AOutput:%0A    (int) 1%0AInputs:%0A    (int) n = 200%0AOutput:%0A    (int) 487067745%0AUse verify %5Bfile%5D to test your solution and see how it does. When you are finished editing your code, use submit %5Bfile%5D to submit your answer. If your solution passes the test cases, it will be removed from your home folder.%0A*/%0A

Create the_grandest_staircase_of_them_all.java