29 lines
1.1 KiB
Python
29 lines
1.1 KiB
Python
from unittest import TestCase
|
|
from benchmark.check_armstrong import check_armstrong
|
|
|
|
|
|
class Test_check_armstrong(TestCase):
|
|
# distances_true = {1: [2], 2: [1], 3: [0]}
|
|
# distances_false = {1: [0], 2: [0], 3: [149]}
|
|
def test_check_armstrong_1(self):
|
|
assert check_armstrong(n=2) == False
|
|
|
|
# distances_true = {1: [0]}
|
|
# distances_false = {1: [1]}
|
|
def test_check_armstrong_2(self):
|
|
assert check_armstrong(n=0) == True
|
|
|
|
# distances_true = {1: [380], 2: [379], 3: [230], 4: [0, 0, 0, 1], 5: [159]}
|
|
# distances_false = {1: [0], 2: [0], 3: [0], 4: [380, 38, 3, 0], 5: [0]}
|
|
def test_check_armstrong_3(self):
|
|
assert check_armstrong(n=380) == False
|
|
|
|
# distances_true = {1: [153], 2: [152], 3: [3], 4: [0, 0, 0, 1], 5: [0]}
|
|
# distances_false = {1: [0], 2: [0], 3: [0], 4: [153, 15, 1, 0], 5: [1]}
|
|
def test_check_armstrong_4(self):
|
|
assert check_armstrong(n=153) == True
|
|
|
|
# distances_true = {1: [1], 2: [0]}
|
|
# distances_false = {1: [0], 2: [1]}
|
|
def test_check_armstrong_5(self):
|
|
assert check_armstrong(n=1) == True
|