icaema
/
advent-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

brute, ugh

This commit is contained in:
icaema 2023-12-07 22:38:33 -05:00
parent 5ef2d62477
commit 69438229b9
1 changed files with 18 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
day-06/src/part02.py
View File

@ -21,31 +21,12 @@ f = open(FILENAME, "r")
#for line in sys.stdin: #for line in sys.stdin:
lines = f.readlines() lines = f.readlines()
p_time = lines[0][5:].replace(' ', '').split() #p_time = lines[0][5:].replace(' ', '').split()
p_farthest = lines[1][9:].replace(' ', '').split() time = int(lines[0][5:].replace(' ', ''))
debug_print("input", f"ptime: {p_farthest}, p_farthest: {p_farthest}") farthest = int(lines[1][9:].replace(' ', ''))
debug_print("input", f"ptime: {time}, p_farthest: {farthest}")
races = [(int(p_time[i]), int(p_farthest[i])) for i in range(len(p_time))]
debug_print("races", races)
result = 1
for race in races:
winning_sleeptimes = len([slt for slt in range(race[0]) if (race[0]-slt)*slt > race[1]])
print(winning_sleeptimes)
result *= winning_sleeptimes
#for race in races:
# #winning_sleeptimes = 0
# less_count = 0
# sleepTime = 1
# while calc_distance(race.time, sleepTime) < race.distance:
# less_count += 1
# sleepTime += 1
# result *= race.time - less_count*2 -1
#debug_print("races", races)
print("") print("")
@ -53,8 +34,21 @@ print(" Proccessing:")
print("===================================\n"); print("===================================\n");
# Insert Processing Code # Insert Processing Code
result = 1
winning_sleeptimes = 1
debug_print("time&d", time, farthest)
winning_sleeptimes = len([1 for slt in range(time) if (time-slt)*slt > farthest])
print(winning_sleeptimes)
result *= winning_sleeptimes
#winning_sleeptimes = 0
#less_count = 0
#sleepTime = 1
#while (time - sleepTime)*sleepTime < farthest:
# less_count += 1
# sleepTime += 1
#result *= time - less_count*2 -1