Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Count Chains solution in Uncategorized category for Count Chains by Elena_Korljukova
from typing import List, Tuple
def count_chains(circles: List[Tuple[int, int, int]]) -> int:
b = [i for i in range(len(circles))]
k = 0
while b:
a = [b.pop(0)]
for i in a:
a += [j for j in b if (circles[i][2] - circles[j][2])**2 < (circles[i][0] - circles[j][0])**2 + (circles[i][1] - circles[j][1])**2 < (circles[i][2] + circles[j][2])**2]
b = [x for x in b if x not in a]
k += 1
return k
if __name__ == '__main__':
print("Example:")
print(count_chains([(1, 1, 1), (4, 2, 1), (4, 3, 1)]))
# These "asserts" are used for self-checking and not for an auto-testing
assert count_chains([(1, 1, 1), (4, 2, 1), (4, 3, 1)]) == 2, 'basic'
assert count_chains([(1, 1, 1), (2, 2, 1), (3, 3, 1)]) == 1, 'basic #2'
assert count_chains([(2, 2, 2), (4, 2, 2), (3, 4, 2)]) == 1, 'trinity'
assert count_chains([(2, 2, 1), (2, 2, 2)]) == 2, 'inclusion'
assert count_chains([(1, 1, 1), (1, 3, 1), (3, 1, 1), (3, 3, 1)]) == 4, 'adjacent'
assert count_chains([(0, 0, 1), (-1, 1, 1), (1, -1, 1), (-2, -2, 1)]) == 2, 'negative coordinates'
print("Coding complete? Click 'Check' to earn cool rewards!")
June 21, 2020