Set 105Question 67
Meherun's Optimal Transformation Cost
Very hardWritten in CMust finish in 5 seconds
Meherun is comparing two versions of a document at a school fair and needs the minimum edit distance between them.
What your program reads
Two strings A and B.
What your program prints
Minimum edit distance.
Limits
1 ≤ |A|,|B| ≤ 2000
Example input
kitten sitting
Expected output
3
main.c
Your work is saved in this browser as you type.
Loading editor…
Input for Run
Run tries your code on the input above and shows what it prints. Submit checks your output against every test, including hidden ones.
Shortcut: Ctrl + Enter sends it to the judge.