Solution: We first consider when $u\oplus v> \min(u,v)$. It is not difficult to find that $u\oplus v> \min(u,v)$ if and only if one of the highest bits of u and v is 0 and the other is 1. Take the following picture as an example:…
Solution: First of all, we can naturally notice that i=1 will directly affect all numbers, and the final result will only be affected by b[1]-a[1].…
A. Era Solution: Just simulation. When we find a certain a[i]>i+ ans, insert the number of a[i]-(i+ ans). Code: Java C++…
Solution: Obviously, we don't need to consider the operation sequence. Therefore, we directly consider how to perform several operations on a certain number.…
A. Linear Keyboard Solution: Just simulate according to the question. Code: Java C++…
Solution: Obviously, if two dishes are the same, then the total weight of the two dishes must also be the same. According to the previous question, we know that we can calculate the value range of the last remaining a.…
Solution: We represent the total remain weight of each dish by $remain_i$, which obviously has $remain_i=a_i+b_i-m$.…
Solution: Obviously it is a memory search. Obviously, the maximum distance that the current point can travel = the maximum distance of the next point+1.…
蜀ICP备19018968号