Search found 1 match
Search found 1 match • Page 1 of 1
- Mon Sep 26, 2005 12:33 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10902 - Pick-up Sticks
- Replies: 24
- Views: 14061
[quote="wook"] it seems that o(n^2) algorithm with efficient cutting makes AC, if the number of top sticks is small. also waterloo's solution is o(n^2). BUT there can be worst case, by 1st~99999th stick, every sticks are top sticks, and 100000th stick crosses all of them; then answer is 1 ...