Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Comprehensive solution in Clear category for Break Rings by okipow
def break_rings(rings):
from functools import reduce
import itertools
merge = reduce(set.union, rings)
n = 1
while True:
for j in itertools.combinations(merge, n):
if [x for x in rings if x & set(j) == set()] == []:
return n
n += 1
if __name__ == '__main__':
# These "asserts" using only for self-checking and not necessary for auto-testing
assert break_rings(({1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}, {4, 6})) == 3, "example"
assert break_rings(({1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4})) == 3, "All to all"
assert break_rings(({5, 6}, {4, 5}, {3, 4}, {3, 2}, {2, 1}, {1, 6})) == 3, "Chain"
assert break_rings(({8, 9}, {1, 9}, {1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}, {6, 7}, {8, 7})) == 5, "Long chain"
Oct. 25, 2015
