文件名称:Shortest_path_counting
- 所属分类：
- 其他小程序
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 207kb
- 下载次数：
- 0次
- 提 供 者：
- 张*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
acm算法设计：
描述：
国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。
找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。
输入：
一整数n为行数和列的棋盘。0 < n <=16
输出：
数量的最短路径。
例输入：
3或4
例输出：
6或20 -Descr iption：
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
描述：
国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。
找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。
输入：
一整数n为行数和列的棋盘。0 < n <=16
输出：
数量的最短路径。
例输入：
3或4
例输出：
6或20 -Descr iption：
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
Shortest
path
counting
Shortest
path
counti
ACM
Shortest
path
counti
paths
Easy
Counting
a
A
chess
rook
can
move
horizontally
shortest
paths
by
which
a
rook
can
move
from
one
c
ACM
算法
Shortest
path
counting
Shortest
path
counti
ACM
Shortest
path
counti
paths
Easy
Counting
a
A
chess
rook
can
move
horizontally
shortest
paths
by
which
a
rook
can
move
from
one
c
ACM
算法
(系统自动生成,下载前可以参看下载内容)
下载文件列表
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
......................\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