Python

Search

grandest staircase foobar

def solution(n):
    m = [[0 for i in range(n + 1)] for j in range(n + 1)]
    m[0][0] = 1  # base case
    for stair in range(1, n + 1):
	    for left in range(0, n + 1):
	        m[stair][left] = m[stair - 1][left]
	        if left >= stair:
	            m[stair][left] += m[stair - 1][left - stair]
	          	
    return m[n][n] -1

Comment

PREVIOUS	NEXT

Code Example
Python :: num1=int(self.t1.get())
Python :: discord pycord add a URL button in a subclassed view
Python :: change set item python
Python :: Kinesis Client get_records response json
Python :: run python script from bash script
Python :: spark group by alias
Python :: convert .tiff image stack to unit8 format
Python :: specificity formula python
Python :: histogram plot seaborn
Python :: check version of various pkgs
Python :: Python Print Variable Using the String Formatting with the help of % character
Python :: django route accept params with character
Python :: cannot access modules from neighbouring directories jupyter notebook
Python :: print a box like the ones below
Python :: Install pip and add virtual environment to the Python Kernel
Python :: threshhold crossing on list python
Python :: access data in one python function from another
Python :: python image resize
Python :: Maximum number of guests on cruise at an instance tcs
Python :: django form is onvalid
Python :: Pouring 8 litres into 2 empty container of size 3 and 5 to get 4 litre in any container
Python :: convert float to booelan
Python :: Can the string find method be used to search a list?
Python :: python get next item from generator
Python :: np where pandas with 3 choices
Python :: qmenu hide python
Python :: python convert py to exe
Python :: default arguments
Python :: python inspect class
Python :: TypeError: can only concatenate str (not "list") to str

Search

PYTHON

grandest staircase foobar

ADD CONTENT