Test results - Codility

Tasks Details

easy

1. ChocolatesByNumbers

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

Task Score

75%

Correctness

100%

Performance

50%

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:

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.

Write an efficient algorithm for the following assumptions:

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

Solution

Programming language used Python

Time spent on task 3 minutes

Notes

not defined yet

Task timeline

Code: 03:25:30 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int N, int M) {
        // write your code in Java SE 8
    }
}

Code: 03:26:01 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

def gcd(M, N):

    if M == N:
        re

Code: 03:26:22 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)

Code: 03:26:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)

Code: 03:27:03 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Code: 03:27:16 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    return N / gcf

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'float'> found.

Code: 03:27:30 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    print(N / gcf)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

5.0

Code: 03:27:39 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    print(inN / gcf)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Code: 03:27:43 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    print(N // gcf)

def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 03:27:56 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    #print(N // gcf)
    return N // gcf


def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 03:28:01 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    #print(N // gcf)
    return N // gcf


def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 03:28:04 UTC, py, final, score: 75

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, M):

    gcf = gcd(N, M)

    #print(N // gcf)
    return N // gcf


def gcd(M, N):

    if M == N:
        return M
    if M > N:
        return gcd(M - N, N)
    else:
        return gcd(N - M, M)

Analysis summary

The following issues have been detected: runtime errors.

For example, for the input (1000000000, 1) the solution terminated unexpectedly.

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

extreme_small
very small N and M

✔

0.036 s

▶

simple
simple test, N = 24, M = 18

✔

0.036 s

▶

small1
small tests

✔

0.036 s

▶

small2
small tests

✔

0.036 s

expand all Performance tests

▶

medium
medium tests

✔

0.036 s

▶

large
large tests

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 127, in <module>
    main()
  File "exec.py", line 89, in main
    result = solution( N, M )
  File "/tmp/solution.py", line 6, in solution
    gcf = gcd(N, M)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  [Previous line repeated 992 more times]
  File "/tmp/solution.py", line 14, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison

0.036 s

▶

large2
N = (3**9)*(2**14), M=(2**14)*(2**14)

✔

0.036 s

▶

extreme_large
maximal and minimal values

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 127, in <module>
    main()
  File "exec.py", line 89, in main
    result = solution( N, M )
  File "/tmp/solution.py", line 6, in solution
    gcf = gcd(N, M)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  [Previous line repeated 992 more times]
  File "/tmp/solution.py", line 14, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison

0.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 127, in <module>
    main()
  File "exec.py", line 89, in main
    result = solution( N, M )
  File "/tmp/solution.py", line 6, in solution
    gcf = gcd(N, M)
  File "/tmp/solution.py", line 19, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 17, in gcd
    return gcd(M - N, N)
  [Previous line repeated 991 more times]
  File "/tmp/solution.py", line 14, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison

0.036 s