Description： A chess rook can move horizontally or vertically to any square in the same row or in the same column of a chessboard. Find the number of shortest paths by which a rook can move from one corner of a chessboard to the diagonally opposite corner。 Input： a interger number n is row and column of chessboard. 0 < n <=16 Output： the number of shortest paths. Sample Input： 3or4 Sample Output： 6or20

Shortest path counting
......................\Debug
......................\.....\Shortest path counting.exe
......................\.....\Shortest path counting.ilk
......................\.....\Shortest path counting.obj
......................\.....\Shortest path counting.pch
......................\.....\Shortest path counting.pdb
......................\.....\StdAfx.obj
......................\.....\vc60.idb
......................\.....\vc60.pdb
......................\ReadMe.txt
......................\Shortest path counting.cpp
......................\Shortest path counting.dsp
......................\Shortest path counting.dsw
......................\Shortest path counting.ncb
......................\Shortest path counting.opt
......................\Shortest path counting.plg
......................\StdAfx.cpp
......................\StdAfx.h

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