ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1018. Binary Apple Tree

How can it be?
Posted by Ivanov Alexander 29 Jul 2008 16:14
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?
Posted by bsu.mmf.team 24 Sep 2008 22:28


Edited by author 24.09.2008 22:29