08 2024 档案

摘要:Problem Link If we pick A[i] the 2nd time, it means we have a cycle. Proof: 1st time we pick A[i], the sum before adding A[i] is x; 2nd time we pick A 阅读全文
posted @ 2024-08-16 08:05 Review->Improve 阅读(36) 评论(0) 推荐(0)
摘要:Problem Link Based on initial observation, it seems that greedily pick the smallest row / column length works. But the last example test case outputs 阅读全文
posted @ 2024-08-14 23:46 Review->Improve 阅读(88) 评论(0) 推荐(0)