Test results - Codility

Tasks Details

medium

1. CommonPrimeDivisors

Check whether two numbers have the same prime divisors.

Task Score

46%

Correctness

85%

Performance

A prime is a positive integer X that has exactly two distinct divisors: 1 and X. The first few prime integers are 2, 3, 5, 7, 11 and 13.

A prime D is called a prime divisor of a positive integer P if there exists a positive integer K such that D * K = P. For example, 2 and 5 are prime divisors of 20.

You are given two positive integers N and M. The goal is to check whether the sets of prime divisors of integers N and M are exactly the same.

For example, given:

N = 15 and M = 75, the prime divisors are the same: {3, 5};

N = 10 and M = 30, the prime divisors aren't the same: {2, 5} is not equal to {2, 3, 5};

N = 9 and M = 5, the prime divisors aren't the same: {3} is not equal to {5}.

Write a function:

def solution(A, B)

that, given two non-empty arrays A and B of Z integers, returns the number of positions K for which the prime divisors of A[K] and B[K] are exactly the same.

For example, given:

A[0] = 15 B[0] = 75 A[1] = 10 B[1] = 30 A[2] = 3 B[2] = 5

the function should return 1, because only one pair (15, 75) has the same set of prime divisors.

Write an efficient algorithm for the following assumptions:

Z is an integer within the range [1..100,000];

each element of arrays A and B is an integer within the range [1..2,147,483,647].

Solution

Programming language used Python

Time spent on task 21 minutes

Notes

not defined yet

Code: 07:03:34 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[] A, int[] B) {
        // write your code in Java SE 8
    }
}

Code: 07:03:45 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

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

def solution(A, B):
    # write your code in Python 3.6
    pass

Code: 07:07:50 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

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

def solution(A, B):
    # write your code in Python 3.6
    pass

Code: 07:08:07 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

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

def solution(A, B):
    # write your code in Python 3.6
    pass

def gcd()

Code: 07:08:19 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

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

def solution(A, B):
    # write your code in Python 3.6
    pass

def gcd(N, M):
    if M == 1:

Code: 07:08:34 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(A, B):
    # write your code in Python 3.6
    pass

def gcd(N, M):
    if M == 0:
        return M

Code: 07:08:46 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(A, B):
    # write your code in Python 3.6
    pass

def gcd(N, M):
    if M == 0:
        return M
    return gcd()

Code: 07:08:56 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(A, B):
    # write your code in Python 3.6
    pass

def gcd(N, M):
    if M == 0:
        return M
    return gcd(M, N % M)

Code: 07:09:27 UTC, py, autosave

show code in pop-up

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

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

def solution(A, B):
    # write your code in Python 3.6
    


def gcd(N, M):
    if M == 0:
        return M
    return gcd(M, N % M)

Code: 07:09:45 UTC, py, verify, result: Failed

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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(gcd(a, b))


def gcd(N, M):
    if M == 0:
        return M
    return gcd(M, N % 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:

0
0
0

Code: 07:09:58 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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(a, b)


def gcd(N, M):
    if M == 0:
        return M
    return gcd(M, N % M)

Code: 07:10:00 UTC, py, verify, result: Failed

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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(a, b)


def gcd(N, M):
    if M == 0:
        return M
    return gcd(M, N % 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:

15 75
10 30
9 5

Code: 07:10:44 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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(a, b)


def gcd(M, N):

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

Code: 07:10:55 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

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(a, b)
        gcd(a, b)

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:

15 75
10 30
9 5

Code: 07:11:07 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

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(a, b)
        print(gcd(a, b))

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: 07:12:12 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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        print(gcd(a, b))

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

Code: 07:12:42 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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)

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

Code: 07:12: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(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)

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.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

1.0
5.0
1.0
3.0
9.0
5.0

Code: 07:13:31 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 18

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        

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

Code: 07:13:37 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 18

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

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: 07:14:56 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 18 19 20

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        i

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

Code: 07:15:16 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 18 19 20

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        if gcd % (a / gcd_value)

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

Code: 07:15:40 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 18 19 20 21

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            retur

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

Code: 07:15:53 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 18 19 20 21

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            print(gcd)

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

Code: 07:16:04 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 18 19 20 21

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

def solution(A, B):
    # write your code in Python 3.6
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            print(gcd)

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

Code: 07:16:22 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 18 19 20 21 22 23 24 25

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)


        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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

Code: 07:16:22 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 18 19 20 21 22 23 24 25

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)


        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 14, in solution
    if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
TypeError: unsupported operand type(s) for %: 'function' and 'float'

Code: 07:16:37 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 18 19 20 21 22 23 24 25

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)


        if gcd % int(a / gcd_value) != 0 or gcd % int(b / gcd_value) != 0:
            count += 1 
        
    print(count)

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:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 14, in solution
    if gcd % int(a / gcd_value) != 0 or gcd % int(b / gcd_value) != 0:
TypeError: unsupported operand type(s) for %: 'function' and 'int'

Code: 07:16:53 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 18 19 20 21 22 23 24 25

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)


        if gcd % in(a / gcd_value) != 0 or gcd % int(b / gcd_value) != 0:
            count += 1 
        
    print(count)

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

Code: 07:17:04 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 18 19 20 21 22 23 24 25

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)


        #if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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

Code: 07:17:19 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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        print(gcd % (a/gcd_value))

        #if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            #count += 1 
        
    print(count)

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.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 13, in solution
    print(gcd % (a/gcd_value))
TypeError: unsupported operand type(s) for %: 'function' and 'float'

Code: 07:17:36 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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        print(gcd % (a/gcd_value))

        if gcd % (a / gcd_value) != 0 or gcd % (b / gcd_value) != 0:
            #count += 1 
        
    print(count)

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

Code: 07:17:53 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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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

Code: 07:17:56 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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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: 07:18:25 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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
    #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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

Code: 07:18: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 18 19 20 21 22 23 24 25 26

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
        
    print(count)

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: 07:19:31 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
            prin
        
    print(count)

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

Code: 07:19: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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) != 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
            print(a, b)
        
    print(count)

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: 07:21:05 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 or gcd_value % (b / gcd_value) != 0:
            count += 1 
            print(a, b)
        
    print(count)

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

Code: 07:21:15 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 or gcd_value % (b / gcd_value) == 0:
            count += 1 
            print(a, b)
        
    print(count)

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

Code: 07:21:30 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            print(a, b)
        
    print(count)

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

Code: 07:21:35 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            print(a, b)
        
    print(count)

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: 07:21:48 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 18 19 20 21 22 23 24 25 26 27

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    print(count)

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

Code: 07:22:04 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 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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: 07:22:16 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 18 19 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

Code: 07:23:02 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 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 0

User test case 1:

[[], []]

Code: 07:23:08 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 18 19 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

Code: 07:23:14 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 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

stdout:

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 0

User test case 1:

[[], []]

Code: 07:23:56 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 18 19 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        print(b/gcd_value)
        print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

Code: 07:24: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 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 0

User test case 1:

[[], []]

Code: 07:24:04 UTC, py, final, score: 46

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        gcd_value = gcd(a, b)
        #print(a/gcd_value)
        #print(b/gcd_value)
        #print(gcd_value)

        #print(gcd % (a/gcd_value))

        if gcd_value % (a / gcd_value) == 0 and gcd_value % (b / gcd_value) == 0:
            count += 1 
            #print(a, b)
        
    #print(count)
    return count 

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: wrong answers, runtime errors.

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

extreme
extreme test with small values

✔

0.036 s

▶

simple_1
simple test with small values

✔

0.036 s

▶

simple_2
simple test with small values

✔

0.036 s

▶

primes
powers of primes

✔

0.036 s

▶

small_primes
small primes

✔

0.036 s

▶

small_all_pairs
all pairs 1-10, length = 100

✘

WRONG ANSWER
got 16 expected 18

0.036 s

WRONG ANSWER, got 16 expected 18

▶

small_random
small random test, length = 100

✔

0.036 s

expand all Performance tests

▶

large_all_pairs
all pairs 1-70, length = ~5,000

✘

WRONG ANSWER
got 146 expected 182

0.060 s

WRONG ANSWER, got 146 expected 182

▶

large_random
large random tests, length = ~6,000

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.052 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 8, in solution
    gcd_value = gcd(a, b)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  [Previous line repeated 979 more times]
  File "/tmp/solution.py", line 23, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison

0.052 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 8, in solution
    gcd_value = gcd(a, b)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  [Previous line repeated 13 more times]
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 28, in gcd
    return gcd(N - M, M)
  File "/tmp/s

▶

many_factors
factorial test

✘

WRONG ANSWER
got 0 expected 6000

0.056 s

WRONG ANSWER, got 0 expected 6000

▶

many_factors2
factorial test

✘

WRONG ANSWER
got 3450 expected 4950

0.064 s

WRONG ANSWER, got 3450 expected 4950

▶

big_powers
powers of 2 and 3

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.052 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 8, in solution
    gcd_value = gcd(a, b)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  [Previous line repeated 992 more times]
  File "/tmp/solution.py", line 23, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison

▶

extreme_maximal
extreme test with maximal values

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.052 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 139, in <module>
    main()
  File "exec.py", line 101, in main
    result = solution( A, B )
  File "/tmp/solution.py", line 8, in solution
    gcd_value = gcd(a, b)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  File "/tmp/solution.py", line 26, in gcd
    return gcd(M - N, N)
  [Previous line repeated 992 more times]
  File "/tmp/solution.py", line 23, in gcd
    if M == N:
RecursionError: maximum recursion depth exceeded in comparison