10271 - Chopsticks
Description
See the Online Judge web site for a description of Chopsticks.Test of the Submissions
We have submitted the problem to the following test:- 2,500 demands with: (1) the number 1, for the number of cases. (2) a random number of guests (Guests) between 1 and 10, inclusive, (3) a random number of chopsticks (N), with 3*Guests+24 <= N <= 3*Guests+24+200, (4) N random integers for the lengths of the chopsticks, each chopstick between 1 and 10 longer than the previous.
Publications
None.Last updated: 7 November 2005