Scribd Logo
Upload

Welcome to Scribd!

  • Dynamic

    Uploaded by

    Rijit
    2 views1 page
    The document defines a count_decomps function that takes a string as input and uses dynamic programming to count the number of distinct decompositions of the string into palindromic subsequences. It initializes a 2D table NPS to track the number of decompositions and whether each substring is a palindrome. It recursively fills the table, counting decompositions based on whether the current substring is a palindrome and matching the base cases. Finally, it returns the number of decompositions for the full input string. The code also includes an example that calls count_decomps on the string 'madam' and prints the result, then plots a function with labels expressing affection.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines a count_decomps function that takes a string as input and uses dynamic programming to count the number of distinct decompositions of the string into palindromic subsequences. It initializes a 2D table NPS to track the number of decompositions and whether each substring is a palindrome. It recursively fills the table, counting decompositions based on whether the current substring is a palindrome and matching the base cases. Finally, it returns the number of decompositions for the full input string. The code also includes an example that calls count_decomps on the string 'madam' and prints the result, then plots a function with labels expressing affection.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    2 views1 page

    Dynamic

    Uploaded by

    Rijit
    The document defines a count_decomps function that takes a string as input and uses dynamic programming to count the number of distinct decompositions of the string into palindromic subsequences. It initializes a 2D table NPS to track the number of decompositions and whether each substring is a palindrome. It recursively fills the table, counting decompositions based on whether the current substring is a palindrome and matching the base cases. Finally, it returns the number of decompositions for the full input string. The code also includes an example that calls count_decomps on the string 'madam' and prints the result, then plots a function with labels expressing affection.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    def count_decomps(s):

    n = len(s)

    # DP table
    NPS = [[{'num': 0, 'ispal': False} for _ in range(n)] for _ in range(n)]

    # Base cases
    for i in range(n):
    NPS[i][i]['num'] = 1
    NPS[i][i]['ispal'] = True

    for l in range(2, n + 1):


    for i in range(n - l + 1):
    j=i+l-1

    if s[i] == s[j]:
    if l == 2 or NPS[i + 1][j - 1]['ispal']:
    NPS[i][j]['num'] = NPS[i + 1][j - 1]['num'] + 1
    NPS[i][j]['ispal'] = True

    if not NPS[i][j]['ispal']:
    NPS[i][j]['num'] = NPS[i][j - 1]['num'] + NPS[i + 1][j]['num'] - NPS[i + 1][j - 1]['num']

    return NPS[0][n - 1]['num']

    s = 'madam'
    numberDec = count_decomps(s)
    print(numberDec)

    import matplotlib.pyplot as plt


    import numpy as np

    t = np.linspace(0, 2 * np.pi, 1000)


    x = 16 * np.sin(t)**3
    y = 13 * np.cos(t) - 5 * np.cos(2*t) - 2 * np.cos(3*t) - np.cos(4*t)

    plt.figure(figsize=(5, 5))
    plt.plot(x, y, 'r')
    plt.fill_between(x, y, color='red', alpha=0.5)
    plt.xlim(-20, 20)
    plt.ylim(-20, 20)
    plt.xlabel('I love you the mostest <3')
    plt.ylabel('<333')

    plt.show()

    You might also like