given positive integer decompose find an algorithm to find the number of nonnegative number division or decomposition the complexity is on2 example 1 input 4 output 5 explaination 44 431 422 4211 41111 example input 7 output 15 explaination 77 761 752 7511 743 7421 74111 7331 7322 73211 731111 72221 722111 7211111 71111111 find number of decompositions from decompose decompose integer find number of decompositions from decompose decompose integer
def int_divide(decompose):
    
    arr = [[0 for i in range(decompose + 1)] for j in range(decompose + 1)]
    arr[1][1] = 1
    for i in range(1, decompose + 1):
        for j in range(1, decompose + 1):
            if i < j:
                arr[i][j] = arr[i][i]
            elif i == j:
                arr[i][j] = 1 + arr[i][j - 1]
            else:
                arr[i][j] = arr[i][j - 1] + arr[i - j][j]
    return arr[decompose][decompose]