problem1 link 最后剩下的是中间的一个矩形．所以可以直接枚举这个矩形,如果它含有的硬币个数等于$K$,则再计算移动的最少次数,更新答案． problem2 link 首先,每个节点发送每种消息最多只发送一次:其次,在得到消息之后一定是马上发送而不是等待一会儿再发送:最后一点是,如果第$i$天发送了一种消息,一定可以在第$i+1$天发送另外一种消息． 现在的问题是,一个节点同时有两种消息时,应该首先发送哪一种．这个可以$2^{n}$枚举第一次发送的消息类型,然后模拟即可．在模拟过程中可…
problem1 link 倒着想.每次添加一个右括号再添加一个左括号,直到还原.那么每次的右括号的选择范围为当前左括号后面的右括号减去后面已经使用的右括号. problem2 link 令$h(x)=\sum_{i=1}^{x}g(i)$,那么答案为$h(R)-h(L-1)$.对于$h(x)$: (1)如果$x\leq K$,那么$h(x)=0$ (2)否则对于$[K+1,x]$之间的所有偶数来说,对答案的贡献为$even+h(\frac{x}{2})-h(\frac{K}{2})$,其中$e…
Problem Statement You are given the ints perimeter and area. Your task is to find a triangle with the following properties: The coordinates of each vertex are integers between 0 and 3000, inclusive. The perimeter of the triangle must be exactly…
Problem Statement The Happy Letter game is played as follows: At the beginning, several players enter the field. Each player has a lowercase English letter on their back. The game is played in turns. In each turn, you select two players with dif…
