Two strings X and Y find the longest common subsequence. (X and Y strings are stored in ASCII files 2X.txt and 2Y.txt in) requirements: According to the basic design of dynamic programming ideas to achieve the mission of the C language code and fill in the papers on the results.

test1_2\2X.txt
.......\2Y.txt
.......\Debug\test1_2.exe
.......\.....\test1_2.ilk
.......\.....\test1_2.obj
.......\.....\test1_2.pch
.......\.....\test1_2.pdb
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\test1_2.cpp
.......\test1_2.dsp
.......\test1_2.dsw
.......\test1_2.ncb
.......\test1_2.opt
.......\test1_2.plg
.......\Debug
test1_2

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．