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

UPCOMING CHALLENGES:

CURRENT CHALLENGES:

Cuprum 2018

PAST CHALLENGES

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

Programming language:
Spoken language:

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

int solution(int N, int M);

that, given two non-negative integers N and M, returns a remainder of F(N^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

int solution(int N, int M);

that, given two non-negative integers N and M, returns a remainder of F(N^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

class Solution { public int solution(int N, int M); }

that, given two non-negative integers N and M, returns a remainder of F(N^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

Copyright 2009–2018 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

func Solution(N int, M int) int

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

class Solution { public int solution(int N, int M); }

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

function solution(N, M);

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

function solution(N, M)

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

int solution(int N, int M);

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

function solution(N: longint; M: longint): longint;

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

function solution($N, $M);

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

sub solution { my ($N, $M)=@_; ... }

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

def solution(N, M)

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

def solution(n, m)

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

object Solution { def solution(n: Int, m: Int): Int }

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

public func solution(N : Int, _ M : Int) -> Int

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

public func solution(_ N : Int, _ M : Int) -> Int

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

The Fibonacci sequence is defined by the following recursive formula:

F(0) = 0

F(1) = 1

F(N) = F(N−1) + F(N−2) for N ≥ 2

Write a function:

Private Function solution(N As Integer, M As Integer) As Integer

^{M}) modulo 10,000,103.

Note: 10,000,103 is a prime number.

For example, given N = 2 and M = 3, the function should return 21, since 2^{3} = 8 and F(8) = 21.

Assume that:

- N and M are integers within the range [0..10,000,000].

Complexity:

- expected worst-case time complexity is O(log(N+M));
- expected worst-case space complexity is O(1).

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

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