|
|
|
|
|
| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 29 Aug 2008 14:02:38 IST
|
|
|
there is a chessboard like road,in mid of which is a dig,then un how many ways a person can go from one point to opposite diagonally point without going along the edges of the road.
|
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 30 Aug 2008 11:29:25 IST
|
|
|
is the ans
1- 8/64C8..????
|
IMPOSSIBLES ARE OFTEN UNTRIED... |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
|
|
|
|
|