摘要：A. Counting Kangaroos is Fun There can be only at most N / 2 hold and held pairs based the problem's statment. So a greedy approach is just to divide 阅读全文

摘要：Problem First I thought about modelling this problem as a directed graph, where between each pair of nodes, an edge represents a valid < > or > < tran 阅读全文

摘要：Problem S: the set of numbers said by player 1; P: the set of numbers said by player 2; S^2 * P = a; S * P^2 = b; a * b = (S * P)^3, so a * b must be 阅读全文

摘要：Problem Each fence is increased at most 2 times, so dp[i][j] is the min cost to make A[0, i] great with the last fence A[i] increased j times. The ans 阅读全文

摘要：Problem Key idea: 1. for any substring s, if we can do not consider padding prefix 0s, its decimal value is always >= its length. 2. Appending a binar 阅读全文