Please tell me what's going on here imma lose my stuff https://mirror.codeforces.com/contest/2203/submission/366196095 I'm handling the first case where the sum of the array perfectly divides the health. (h % sum == 0) Here the output is n * (h/sum) + k * (h/sum — 1). Since no need to reload once you've gone through the array For the second case, I'm maintaining a minimum value and checking if I replace that value with max from the suffix.