Y by
2025 IMO leaders are discussing
problems in a meeting. For each
, each leader will talk about the
-th problem for
-th minutes. The chair can assign one leader to talk about a problem of his choice, but he would have to wait for the leader to complete the entire talk of that problem before assigning the next leader and problem. The next leader can be the same leader. The next problem can be a different problem. Each leader’s longest idle time is the longest consecutive time that he is not talking.
Find the minimum positive integer
so that the chair can ensure that the longest idle time for any leader does not exceed
.
Proposed by usjl




Find the minimum positive integer


Proposed by usjl