<p>You are given a string <code>s</code> containing lowercase letters and an integer <code>k</code>. You need to :</p>

<ul>
	<li>First, change some characters of <code>s</code> to other lowercase English letters.</li>
	<li>Then divide <code>s</code> into <code>k</code> non-empty disjoint substrings such that each substring is a palindrome.</li>
</ul>

<p>Return <em>the minimal number of characters that you need to change to divide the string</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;, k = 2
<strong>Output:</strong> 1
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;ab&quot; and &quot;c&quot;, and change 1 character in &quot;ab&quot; to make it palindrome.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aabbc&quot;, k = 3
<strong>Output:</strong> 0
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;aa&quot;, &quot;bb&quot; and &quot;c&quot;, all of them are palindrome.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;leetcode&quot;, k = 8
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= s.length &lt;= 100</code>.</li>
	<li><code>s</code> only contains lowercase English letters.</li>
</ul>

class Solution:
    def palindromePartition(self, s: str, k: int) -> int:
        INF = 1000000
        n = len(s)
        F = [[INF for j in range(k + 1)] for i in range(n)]
        G = [[INF for j in range(n)] for i in range(n)]
        for i in range(n):
            for j in range(i + 1):
                G[i][j] = 0
        for l in range(1, n):
            for i in range(n):
                j = i + l
                if j < n:
                    if s[i] == s[j]:
                        G[i][j] = G[i+1][j-1]
                    # end if
                    G[i][j] = min(G[i][j], G[i+1][j-1]+1)
        # print(G)
        for i in range(n):
            F[i][1] = G[0][i]
        # end for
        for l in range(2, k + 1):
            for j in range(1, n):
                for i in range(j):
                   F[j][l] = min(F[j][l], F[i][l-1] + G[i+1][j])
        # print(F)
        return F[n-1][k]

16800