|
|
back to boardHow can it be? According to the problem's statement q<=n, and the number of branches is equal to n-1. Let's suggest q=n. In this case, how we can save n branches, if there number of is n-1? Edited by author 29.07.2008 17:03 Re: How can it be? Edited by author 24.09.2008 22:29 |
|
|