Given a positive integer, n, and a row vector, x, of positive integers, return a row vector, v, which is a sequence of length n of positive integers, beginning with [1 2...], in which integers that are the sums of any x(i) consecutive previous elements are omitted.
For example, if x = [2 3], meaning integers that are sums of any 2 or 3 consecutive previous elements should be omitted, the output would be v = [1 2 4 5 8 10...v(n)], because 3 is the sum of [1 2], 6 is the sum of [2 4], 7 is the sum of [1 2 4], 9 is the sum of [4 5], and so on, up to n elements of v.
If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted.
Please check test case 3, where number 7 is mistakenly skipped.
Also, number 12 in test case 4 ...
In test case 2, if x=0, should the sequence be 1:22 or completely empty?
@James: "If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted."
@Peng, thank you for the great catch. An illusive issue with my reference solution disrupted test cases 3 and 4. Now fixed.
Count from 0 to N^M in base N.
207 Solvers
207 Solvers
497 Solvers
446 Solvers
228 Solvers