Adding Powers
Suppose you are performing the following algorithm. There is an array v 1 v1 v1, v 2 v2 v2,…, v n vn vn filled with zeroes at start. The following operation is applied to the array several times — at i − t h i-th i−th step ( 0 0 0-indexed) you can:
- either choose position pos ( 1 ≤ p o s ≤ n ) (1≤pos≤n) (1≤pos≤n) and increase v p o s v_{pos} vpos by k i ki ki;
- or not choose any position and skip this step.
You can choose how the algorithm would behave on each step and when to stop it. The question is: can you make array v v
最低0.47元/天 解锁文章
197
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
