Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

UPCOMING CHALLENGES:

Strontium 2019

CURRENT CHALLENGES:

Rubidium 2018

PAST CHALLENGES

Arsenicum 2018

Krypton 2018

Bromum 2018

Future Mobility

Grand Challenge

Decoding Master

Digital Gold

Selenium 2018

Germanium 2018

Gallium 2018

Zinc 2018

Cuprum 2018

Cutting Complexity

Nickel 2018

Cobaltum 2018

Ferrum 2018

Manganum 2017

Chromium 2017

Vanadium 2016

Titanium 2016

Scandium 2016

Calcium 2015

Kalium 2015

Argon 2015

Chlorum 2014

Sulphur 2014

Phosphorus 2014

Silicium 2014

Aluminium 2014

Magnesium 2014

Natrium 2014

Neon 2014

Fluorum 2014

Oxygenium 2014

Nitrogenium 2013

Carbo 2013

Boron 2013

Beryllium 2013

Lithium 2013

Helium 2013

Hydrogenium 2013

Omega 2013

Psi 2012

Chi 2012

Phi 2012

Upsilon 2012

Tau 2012

Sigma 2012

Rho 2012

Pi 2012

Omicron 2012

Xi 2012

Nu 2011

Mu 2011

Lambda 2011

Kappa 2011

Iota 2011

Theta 2011

Eta 2011

Zeta 2011

Epsilon 2011

Delta 2011

Gamma 2011

Beta 2010

Alpha 2010

ambitious

Find the shortest addition chain ending with a given integer.

Programming language:
Spoken language:

Do you like puzzles? Here is one for you. You are given a positive integer A. The goal is to construct the shortest possible sequence of integers ending with A, using the following rules:

- the first element of the sequence is 1,
- each of the successive elements is the sum of any two preceding elements (adding a single element to itself is also permissible),
- each element is larger than all the preceding elements; that is, the sequence is increasing.

For example, for A = 42, a possible solution is `[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Assume that the following declarations are given:

struct Results { int * R; int N; // Length of the array };

Write a function:

struct Results solution(int A);

that, given an integer A, returns the shortest possible sequence of integers satisfying the above conditions and ending with A.

Result array should be returned as a structure `Results`.

For example, given A = 42, the function may return the sequence `[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

Do you like puzzles? Here is one for you. You are given a positive integer A. The goal is to construct the shortest possible sequence of integers ending with A, using the following rules:

- the first element of the sequence is 1,
- each of the successive elements is the sum of any two preceding elements (adding a single element to itself is also permissible),
- each element is larger than all the preceding elements; that is, the sequence is increasing.

For example, for A = 42, a possible solution is `[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

vector<int> solution(int A);

that, given an integer A, returns the shortest possible sequence of integers satisfying the above conditions and ending with A.

Result array should be returned as a vector of integers.

For example, given A = 42, the function may return the sequence `[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

Do you like puzzles? Here is one for you. You are given a positive integer A. The goal is to construct the shortest possible sequence of integers ending with A, using the following rules:

- the first element of the sequence is 1,
- each of the successive elements is the sum of any two preceding elements (adding a single element to itself is also permissible),
- each element is larger than all the preceding elements; that is, the sequence is increasing.

For example, for A = 42, a possible solution is `[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

class Solution { public int[] solution(int A); }

that, given an integer A, returns the shortest possible sequence of integers satisfying the above conditions and ending with A.

Result array should be returned as an array of integers.

For example, given A = 42, the function may return the sequence `[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

func Solution(A int) []int

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

class Solution { public int[] solution(int A); }

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

function solution(A);

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

function solution(A)

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

NSMutableArray * solution(int A);

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Assume that the following declarations are given:

Results = record R : array of longint; N : longint; {Length of the array} end;

Write a function:

function solution(A: longint): Results;

Result array should be returned as a record `Results`.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

function solution($A);

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

sub solution { my ($A)=@_; ... }

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

def solution(A)

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

def solution(a)

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

object Solution { def solution(a: Int): Array[Int] }

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

public func solution(A : Int) -> [Int]

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

public func solution(_ A : Int) -> [Int]

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

public func solution(_ A : Int) -> [Int]

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

- the first element of the sequence is 1,
- each element is larger than all the preceding elements; that is, the sequence is increasing.

`[1, 2, 3, 6, 12, 24, 30, 42]`. Another possible solution is `[1, 2, 4, 5, 8, 16, 21, 42]`.

Write a function:

Private Function solution(A As Integer) As Integer()

Result array should be returned as an array of integers.

`[1, 2, 3, 6, 12, 24, 30, 42]`, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- A is an integer within the range [1..600].

Information about upcoming challenges, solutions and lessons directly in your inbox.

© 2009–2019 Codility Ltd., registered in England and Wales (No. 7048726). VAT ID GB981191408. Registered office: 107 Cheapside, London EC2V 6DN