Problem 42832. Segmented number sequence

Created by HH

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted.</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 165px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 82.5px; transform-origin: 407px 82.5px; vertical-align: baseline; "><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 383.5px 8px; transform-origin: 383.5px 8px; unicode-bidi: normal; "><span style="">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.</span></span></div><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 380px 8px; transform-origin: 380px 8px; unicode-bidi: normal; "><span style="">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.</span></span></div><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 320px 8px; transform-origin: 320px 8px; unicode-bidi: normal; "><span style="">If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted.</span></span></div></div></div>

Solve

Solution Stats

78 Solutions
15 Solvers

Last Solution submitted on Dec 25, 2022

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Peng Liu on 26 Apr 2016

Please check test case 3, where number 7 is mistakenly skipped.

Peng Liu on 26 Apr 2016

Also, number 12 in test case 4 ...

James on 26 Apr 2016

In test case 2, if x=0, should the sequence be 1:22 or completely empty?

Peng Liu on 26 Apr 2016

@James: "If x = 0, integers that are the sums of any 2 or more consecutive previous elements should be omitted."

HH on 28 Apr 2016

@Peng, thank you for the great catch. An illusive issue with my reference solution disrupted test cases 3 and 4. Now fixed.

Solution Comments

Show comments

Problem Recent Solvers15

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 42832. Segmented number sequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers15

Suggested Problems

More from this Author42

Problem Tags

Community Treasure Hunt

Problem 42832. Segmented number sequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers15

Suggested Problems

More from this Author42

Problem Tags

Community Treasure Hunt

Players