Binary search does not work - counterexample added
Counter example\n\n"abbababbbaaa aabaa a"\n8\n\n\nThe above test can be split into 7 tokens, can\'t be split into 10 tokens and it can be split again into 11 to
# Counter example\n```\n"abbababbbaaa aabaa a"\n8\n```\n\nThe above test can be split into 7 tokens, can\'t be split into 10 tokens and it can be split again into 11 tokens. This problem does not have the BS property.\n\nSome of the incorrect BS solutions passed these tests, because of the order in which they check the values.\n\nIf they hit 11 first, they detect, it is possible, so they go to the left and they find the 7 solution later.\n\nIf they hit 10 first, they detect it is impossible and they go right, finding the 11 solution. It is possible to design the test cases to kill all BS solutions though.
['C++']