To ZhenLiangSC:
I am afraid not.
If a person is removed, he won't be counted after that.
ps. The best algorithm I can find is O(NlogN), by employing an interval
tree or something like that.
Sorry for my poor English, too... :)
[EMAIL PROTECTED] 写道：
first put f to the temp=k-th
I have the same question. It seems the S-G function doesn't work when
there is a draw... ?
Rajiv Mathews 写道：
Is there a way to leverage this solution to handle more than one pile
of matches?
Say there were k piles each containing n_1, n_2, ..., n_k matches,
with the same rules, that is
