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

AVAILABLE LESSONS:

Lesson 1

Iterations

Lesson 2

Arrays

Lesson 3

Time Complexity

Lesson 4

Counting Elements

Lesson 5

Prefix Sums

Lesson 6

Sorting

Lesson 7

Stacks and Queues

Lesson 8

Leader

Lesson 9

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Lesson 12

Euclidean algorithm

Lesson 13

Fibonacci numbers

Lesson 14

Binary search algorithm

Lesson 15

Caterpillar method

Lesson 16

Greedy algorithms

Lesson 17

Dynamic programming

Lesson 90

Tasks from Indeed Prime 2015 challenge

Lesson 91

Tasks from Indeed Prime 2016 challenge

Lesson 92

Tasks from Indeed Prime 2016 College Coders challenge

Lesson 99

Future training

Programming language:
Spoken language:

Write a function:

int solution(int A, int B, int K);

that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:

{ i : A ≤ i ≤ B, i

modK = 0 }

For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

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

Write a function:

int solution(int A, int B, int K);

that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:

{ i : A ≤ i ≤ B, i

modK = 0 }

For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

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

Write a function:

class Solution { public int solution(int A, int B, int K); }

that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.:

{ i : A ≤ i ≤ B, i

modK = 0 }

For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10.

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

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

Write a function:

func Solution(A int, B int, K int) int

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

class Solution { public int solution(int A, int B, int K); }

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

function solution(A, B, K);

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

function solution(A, B, K)

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

int solution(int A, int B, int K);

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

function solution(A: longint; B: longint; K: longint): longint;

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

function solution($A, $B, $K);

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

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

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

def solution(A, B, K)

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

def solution(a, b, k)

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

object Solution { def solution(a: Int, b: Int, k: Int): Int }

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

public func solution(A : Int, _ B : Int, _ K : Int) -> Int

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

public func solution(_ A : Int, _ B : Int, _ K : Int) -> Int

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- expected worst-case space complexity is O(1).

Write a function:

Private Function solution(A As Integer, B As Integer, K As Integer) As Integer

{ i : A ≤ i ≤ B, i

modK = 0 }

Assume that:

- A and B are integers within the range [0..2,000,000,000];
- K is an integer within the range [1..2,000,000,000];
- A ≤ B.

Complexity:

- expected worst-case time complexity is O(1);
- 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