Your algorithm must be incorrect somehow, as there is definitely a legit solution.
I do wish that they provided more than one giant data set and one tiny one for testing purposes, but I guess you could write your own if you really needed it.
On Thu, Oct 21, 2010 at 12:08 PM, J Shraibman <firstname.lastname@example.org>
I did that. ?I still have jugglers who are outranked by all the other jugglers who are in his preferred circuits.
On Thu, 21 Oct 2010, Sam Sandberg wrote:
Yes it has a proper solution. If a juggler's preferred circuit is full, you
need to check and see if he is a better fit for that circuit than someone
else in it, and bump the other person out, and assign them. Think recursion.
"Where is fancy bread? In the heart or in the head?"
?? -Willy Wonka