Search found 3 matches

by TrePe
Wed Nov 02, 2005 2:02 am
Forum: Volume 100 (10000-10099)
Topic: 10089 - Repackaging
Replies: 41
Views: 15597

Very nice solution, guys. Two thumbs up.
And it's O(n), because you do not need to compare each pair and even do not need to sort, in order to find max(t_i). Cute!
by TrePe
Mon Dec 27, 2004 3:29 pm
Forum: Volume 102 (10200-10299)
Topic: 10238 - Throw the Dice
Replies: 6
Views: 4332

Just a hint

For example inputs 50 50 110 and 50 50 2440 should give the same output. But your code doesn't. Hope it helped
by TrePe
Sat Mar 15, 2003 10:36 pm
Forum: Volume 6 (600-699)
Topic: 606 - Keeps Going and Going and ...
Replies: 1
Views: 2811

606 - Keeps Going and Going and ...

Could you please explain, how it is possible to construct list Z from sample input?
Z = zip Z S
which creates structure (if I'm correct)
Z = zip zip zip zip zip ...

I think it should be
Z = zip S Z
Am I right?

Thank you in advance

Go to advanced search