十六個天亮

Problem solving record for Codeforces 1791F. Range Update Point Query.

Problem solving record for Codeforces 2074C. XOR and Triangle.

Problem solving record for Codeforces 83B. Doctor.

Problem solving record for LeetCode 368. Largest Divisible Subset.

Problem solving record for LeetCode 2874. Maximum Value of an Ordered Triplet II.

A collection of LeetCode 2025/04 daily challenge.

Problem solving record for LeetCode 2127. Maximum Employees to Be Invited to a Meeting.

Problem solving record for AtCoder Beginner Contest 389.

Problem solving record for LeetCode 1286. Iterator for Combination.

Problem solving record for LeetCode 295. Find Median from Data Stream.

Problem solving record for LeetCode 53. Maximum Subarray.

Problem solving record for LeetCode 31. Next Permutation.

Problem solving record for AtCoder Beginner Contest 388. Rank 821.

對每個區間求最多可同時配成幾組鏡餅，預處理每個小餅所需的大餅位置，配合線段樹與二分答案查詢。

判斷是否能避開禁止區間抵達終點；以布林 DP 表示可達性，利用矩陣快速冪批次跳過連續好格與壞格。