Search found 5 matches
- Tue Jul 31, 2007 9:46 pm
- Forum: Volume 1 (100-199)
- Topic: 173 - Network Wars
- Replies: 29
- Views: 3435
- Tue Jul 31, 2007 9:09 am
- Forum: Volume 1 (100-199)
- Topic: 173 - Network Wars
- Replies: 29
- Views: 3435
173 Network Wars
I'm getting WA for this problem and I've written and re-written my solution and can't seem to get it. I pass all of the tests found here: http://acm.uva.es/board/viewtopic.php?t=196 So I'm not really sure where the problem is. Anyone else have extra test sets? Any common common mistakes? Are there m...
- Fri Mar 23, 2007 2:47 am
- Forum: Volume 1 (100-199)
- Topic: 120 - Stacks of Flapjacks
- Replies: 118
- Views: 16382
To much surprise, this problem is actually somewhat prominent in Academia. In fact, the minimum number of flips for all n! orderings of n pancakes is unknown for n >= 14. It cannot exhaustively be searched because 14! (factorial) is 87,178,291,200. There are many papers in academia bounding the numb...
- Thu Mar 22, 2007 3:08 am
- Forum: Volume 1 (100-199)
- Topic: 107 - The Cat in the Hat
- Replies: 278
- Views: 26846
- Thu Mar 08, 2007 4:38 am
- Forum: ACM ICPC Archive Board
- Topic: Problem 3277 : Workshops
- Replies: 7
- Views: 7024
I thought I could find a counter-example to your greedy choice, but I can't seem to find it at this moment. Practicing for the world finals I wrote a greedy solution, and I ended up proving to myself that it cannot possibly be greedy (any choice of picking has a counter example). Maybe I didn't thin...