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

painless

There are N chocolates in a circle. Count the number of chocolates you will eat.

Programming language:
Spoken language:

Two positive integers N and M are given. Integer N represents the number of chocolates arranged in a circle, numbered from 0 to N − 1.

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You begin with eating chocolate number 0. Then you omit the next M − 1 chocolates or wrappers on the circle, and eat the following one.

More precisely, if you ate chocolate number X, then you will next eat the chocolate with number (X + M) modulo N (remainder of division).

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

int solution(int N, int M);

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

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

Two positive integers N and M are given. Integer N represents the number of chocolates arranged in a circle, numbered from 0 to N − 1.

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You begin with eating chocolate number 0. Then you omit the next M − 1 chocolates or wrappers on the circle, and eat the following one.

More precisely, if you ate chocolate number X, then you will next eat the chocolate with number (X + M) modulo N (remainder of division).

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

int solution(int N, int M);

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

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

Two positive integers N and M are given. Integer N represents the number of chocolates arranged in a circle, numbered from 0 to N − 1.

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You begin with eating chocolate number 0. Then you omit the next M − 1 chocolates or wrappers on the circle, and eat the following one.

More precisely, if you ate chocolate number X, then you will next eat the chocolate with number (X + M) modulo N (remainder of division).

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

func Solution(N int, M int) int

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

function solution(N, M);

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

function solution(N, M)

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

int solution(int N, int M);

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

function solution($N, $M);

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

def solution(N, M)

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

def solution(n, m)

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

You start to eat the chocolates. After eating a chocolate you leave only a wrapper.

You stop eating when you encounter an empty wrapper.

For example, given integers N = 10 and M = 4. You will eat the following chocolates: 0, 4, 8, 2, 6.

The goal is to count the number of chocolates that you will eat, following the above rules.

Write a function:

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

that, given two positive integers N and M, returns the number of chocolates that you will eat.

For example, given integers N = 10 and M = 4. the function should return 5, as explained above.

Assume that:

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

Complexity:

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

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