Does anyone know, for every possible input, how to guarantee there is always an answer exist?
I have no ideas.
Thanks
Search found 4 matches
- Mon Nov 05, 2018 9:52 pm
- Forum: Volume 1 (100-199)
- Topic: 188 - Perfect Hash
- Replies: 9
- Views: 7620
- Sat Oct 22, 2016 4:25 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11627 - Slalom
- Replies: 1
- Views: 2127
11627 - Slalom wrong answer
Why do I keep wrong answer for this problem?
I also searched accepted solutions online and submitted them, but all of them get wrong answer！
Is there something wrong in the judge system?
Or is there very difficult input data?
thanks
I also searched accepted solutions online and submitted them, but all of them get wrong answer！
Is there something wrong in the judge system?
Or is there very difficult input data?
thanks
- Thu Oct 01, 2015 3:16 am
- Forum: Volume 103 (10300-10399)
- Topic: 10304 - Optimal Binary Search Tree
- Replies: 24
- Views: 16844
Re:
Could you explain what Knuth's algorithm is?Larry wrote:You need to use Knuth's algorithm, it runs in O(n^2) instead of O(n^3)..
Thank you so much.
- Fri Jul 10, 2015 3:01 am
- Forum: Volume 100 (10000-10099)
- Topic: 10061 - How many zero's and how many digits ?
- Replies: 43
- Views: 28836
A hard test case
You can try this case
41 26
41 26