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

Source: livecodestream.dev

Similar codes

2 votes157 views1 answer
Tkinter execute function on enter
Python
0 vote156 views1 answer
Save numpy arrayw with PIL
Python
4 votes127 views8 answers
Is this a rickroll
Python
0 vote154 views1 answer
Change image in tkinter canvas
Python
0 vote154 views1 answer
Et.dump export file to xml write method output
Python
0 vote132 views1 answer
Nunique sort
Python
4 votes191 views5 answers
AttributeError: module 'datetime' has no attribute 'now'
Python
1 vote147 views1 answer
Pygame blit image
Python
5 votes164 views1 answer
Generate a color python
Python
2 votes170 views2 answers
Densenet python keras
Python