def main(): # run_test() inp = iu.get_multi_line_input('input') s = Solution(inp, 0) print s.read() s = Solution(inp, 1) print s.read2()
def run_test(): inp = iu.get_multi_line_input('input_test') # print parse_graph(inp) assert get_strongest(parse_graph(inp), 0, set()) == 31 print parse_graph2(inp) graph, conn = parse_graph2(inp) assert get_longest(graph, 0, conn) == 19
def run_test(): test_image = ['..##', '.#.#', '.###', '####'] assert count(test_image) == 11 assert divide(test_image) == [[['..', '.#'], ['##', '.#']], [['.#', '##'], ['##', '##']]] small_img = ['..', '.#'] assert flip(small_img) == ['.#', '..'] assert flip(small_img, rows=False) == ['..', '#.'] assert rotate(small_img) == ['..', '#.'] assert rotate(rotate(small_img)) == ['#.', '..'] inp = input_utils.get_multi_line_input('test_input') # some checks # print enhance(divide(INITIAL_IMAGE), parse_rules(inp)) # print consolidate([[['##.', '#..', '...'], ['##.', '#..', '...']], [['##.', '#..', '...'], ['##.', '#..', '...']]]) assert run(inp) == 12
def run_test(): global r inp_test = input_utils.get_multi_line_input('input_test') assert run(inp_test) == 1 assert run2(inp_test) == 10
def main(): inp = input_utils.get_multi_line_input('input') network = format_network(inp) print follow(network)
def main(): run_test() inp = iu.get_multi_line_input('input') s = Solution(inp) print s.run()
def run_test(): inp = iu.get_multi_line_input('input_test') s = Solution(inp) assert s.run() == 3
def run_test(): inp = input_utils.get_multi_line_input('test_input') assert parse(inp) == {(1+1j), (-1+0j)} assert run(inp) == 5587 assert run2(inp, iterations=100) == 26 assert run2(inp) == 2511944
def main(): run_test() inp = input_utils.get_multi_line_input('input') print find_closest(inp, 1000) print resolve_collisions(inp, 1000)
def run_test(): inp = input_utils.get_multi_line_input('test_input') assert find_closest(inp, 100) == 0 inp = input_utils.get_multi_line_input('test_input_2') assert resolve_collisions(inp, 100) == 1
def main(): run_test() inp = [int(n) for n in input_utils.get_multi_line_input('input')] print exit_inst(inp) print exit_inst2(inp)
def run_test(): inp_test = [int(n) for n in input_utils.get_multi_line_input('input_test')] assert exit_inst(inp_test) == 5 assert exit_inst2(inp_test) == 10
def run_test(): test_inp = input_utils.get_multi_line_input('test_input') g = create_graph(test_inp) assert len(bfs.perform_bfs(g, 0)) == 6
def main(): run_test() inp = input_utils.get_multi_line_input('input') g = create_graph(inp) print len(bfs.perform_bfs(g, 0)) print find_groups(g)
def run_test(): inp_test = input_utils.get_multi_line_input('input_test') assert bottom(inp_test) == 'tknk' supported_nodes, initial_weights = parse(inp_test) assert compute_total_weight(supported_nodes, initial_weights) == 60
def main(): run_test() inp = input_utils.get_multi_line_input('input') print sum(map(is_valid, inp)) print sum(map(is_valid2, inp))
def main(): run_test() inp = input_utils.get_multi_line_input('input') print bottom(inp) supported_nodes, initial_weights = parse(inp) print compute_total_weight(supported_nodes, initial_weights)
def run_test(): inp = iu.get_multi_line_input('test_input') s = Solution(inp, 0) assert s.read() == 4 inp2 = iu.get_multi_line_input('test_input_2') assert run_duet(inp2) == 3
def main(): run_test() inp = input_utils.get_multi_line_input('input') print run(inp, 5) print run(inp, 18)
def main(): run_test() inp = iu.get_multi_line_input('input') s = Solution(inp, 0) print s.read() print run_duet(inp)
def main(): run_test() inp = iu.get_multi_line_input('input') print get_strongest(parse_graph(inp), 0, set()) graph, conn = parse_graph2(inp) print get_longest(graph, 0, conn)
def main(): run_test() inp = input_utils.get_multi_line_input('input') print sum(map(diff, inp)) print sum(map(check, inp))