这个问题将会让你看到超级雷霆大思考```
Let $n$ be a positive integer. Liu Bang and Xiang Yu have a stick of length 1 and want to divide it between themselves. Liu marks at most $n$ points on the stick, and then Xiang marks at most $n$ points on the stick. The marked points are distinct. Then, the stick is cut at all marked points, creating a number of pieces. Afterwards, they take turns claiming any unclaimed piece of the stick, with Liu going first. Each player's goal is to maximise the total length of their own pieces.

For each $n$ , determine the largest value $c$ such that Liu may guarantee a total length of at least $c$ , regardless of Xiang's play.
```ps:这是IMO 2026 P3

不行，只让哈吉米3.6f思考了1分46秒 哈吉米王朝了

哈基米没有原始 cot 自然不会有雷霆大思考，要不然我估计哈吉米雷霆大思考的雷霆程度绝对不低

每秒309

106*309=32754 也不算多

思考虽然少，但我估计雷霆程度有的一拼 ^-^