P2758 Edit Distance

Let $A$ and $B$ be two strings. We want to transform string $A$ into string $B$ using the minimum number of character operations. There are three types of operations: 1. Delete one character. 2. Insert one character. 3. Replace one character with another. Both $A$ and $B$ contain only lowercase letters.

The first line contains string $A$. The second line contains string $B$. Both have length at most $2000$.

Output a single positive integer, which is the minimum number of character operations.

For $100 \%$ of the testdata, $1 \le |A|, |B| \le 2000$. Translated by ChatGPT 5