Hanno problem: there is a Vatican ancient tower, the tower has three Block A, B, C, to A Block, plate sizes 64 to move to C through B, seat, and keep the next platter of small dishes in on. The use of recursive methods to solve ~

hanoi01\hanoi01.dsw
.......\hanoi01.ncb
.......\Debug\vc60.idb
.......\.....\vc60.pdb
.......\.....\hanoi01.pch
.......\.....\hanoi.obj
.......\.....\hanoi01.ilk
.......\.....\hanoi01.exe
.......\.....\hanoi01.pdb
.......\.....\hanoi.pch
.......\.....\hanoi.ilk
.......\.....\hanoi.exe
.......\.....\hanoi.pdb
.......\.....\hanoi.opt
.......\hanoi.c
.......\hanoi01.plg
.......\hanoi01.opt
.......\hanoi01.dsp
.......\HANOI.OBJ
.......\HANOI.EXE
.......\hanoi.ncb
.......\hanoi.plg
.......\aaa.exe
.......\a.exe
.......\hanoi.dsp
.......\hanoi.opt
.......\hanoi.dsw
.......\hanoi.rar
.......\Debug
hanoi01

• 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．