Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
dictionary of set solution in Clear category for How to Find Friends by Sim0000
def check_connection(network, first, second):
d = {}
for connect in network:
a, b = connect.split('-')
if a not in d: d[a] = {a}
if b not in d: d[b] = {b}
d[a] |= d[b]
for i in d[b]: d[i] = d[a]
return second in d[first]
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"scout2", "scout3") == True, "Scout Brotherhood"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"super", "scout2") == True, "Super Scout"
assert check_connection(
("dr101-mr99", "mr99-out00", "dr101-out00", "scout1-scout2",
"scout3-scout1", "scout1-scout4", "scout4-sscout", "sscout-super"),
"dr101", "sscout") == False, "I don't know any scouts."
Oct. 29, 2020
Comments:
