def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
tree = build_tree(runner.input_data[0])
runner.finish([tree.value])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
shrunk_len = improved_shrink(runner.input_data[0])
runner.finish([shrunk_len])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
coords = create_coords(runner.input_data)
largest_area = determine_largest_area(coords)
runner.finish([largest_area])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
result = find_one_letter_diff_record(runner.input_data)
runner.finish([result])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
repeats = calculate_repeated(runner.input_data)
checksum = repeats["Two"] * repeats["Three"]
runner.finish([checksum])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
iterations = process_data(runner.input_data)
frequency = 0
frequency = calculate_frequency(frequency, iterations)
runner.finish([frequency])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
claims = create_claims(process_input(runner.input_data))
claim = determine_not_overlapped(claims)
runner.finish([claim.id])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
iterations = process_data(runner.input_data)
frequency = 0
repeated_position = find_repeated_position(frequency, iterations)
runner.finish([repeated_position])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
raw_steps = process_input(runner.input_data)
steps = create_steps(raw_steps)
execution_log = execute_steps(steps)
runner.finish([execution_log])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
coords = create_coords(runner.input_data)
distance_sum = 10000
largest_area = determine_largest_area_withing_distance_sum(
coords, distance_sum)
runner.finish([largest_area])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
claims = create_claims(process_input(runner.input_data))
overlaps = calculate_overlaps(claims)
matrix = mapping(overlaps)
overlap_area = calculate_overlap_area(matrix)
runner.finish([overlap_area])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
raw_steps = process_input(runner.input_data)
steps = create_steps(raw_steps)
base_time = 60
worker_num = 5
execution_log = execute_steps(steps, base_time, worker_num)
runner.finish([execution_log])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
runner.input_data.sort()
shifts = create_shifts(runner.input_data)
most_asleep = get_most_asleep(shifts)
checksum = int(most_asleep["GUARD_ID"]) * most_asleep["MINUTE"]
runner.finish([checksum])
def __main__():
# BE SURE TO RENAME PARENT_FOLDER_NAME VARIABLE
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
runner.input_data.sort()
shifts = create_shifts(runner.input_data)
most_tired_guard = obtain_most_tired_guard(shifts)
shifts_for_guard = get_shifts_for_guard(shifts, most_tired_guard)
most_asleep_minute = get_most_asleep_minute(shifts_for_guard)
checksum = int(most_tired_guard) * most_asleep_minute
runner.finish([checksum])
def __main__():
runner = Runner(INPUT_PATH, OUTPUT_PATH, debug=True)
# Your code goes here
runner.finish([])