Skip to content

Commit 67a0850

Browse files
author
Simon Hessner
committed
Remove unneeded code and comments
1 parent 395a013 commit 67a0850

File tree

1 file changed

+4
-8
lines changed

1 file changed

+4
-8
lines changed

day11/solution.py

+4-8
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,19 @@
1+
# https://adventofcode.com/2018/day/11
2+
13
import numpy as np
24
inpt = 3463
3-
#inpt = 18
45

5-
grid = np.zeros((300,300), dtype=np.int) #coord 1 to 300
6+
grid = np.zeros((300,300), dtype=np.int)
67

78
def get_power_level(x,y):
89
rid = x+10
910
tmp = (rid* y + inpt)*rid
10-
return (tmp//100)%10 - 5
11-
11+
return (tmp//100)%10 - 5 # get hundreds digit and subtract 5
1212

1313
for x in range(300):
1414
for y in range(300):
1515
grid[x,y] = get_power_level(x+1, y+1)
1616

17-
18-
1917
def find_best(minsize, maxsize):
2018
biggest = None
2119
bestx, besty = -1, -1
@@ -35,9 +33,7 @@ def find_best(minsize, maxsize):
3533
biggest = tmpbiggest
3634
bestx, besty = x+1,y+1
3735
bestsize = size
38-
#print(">", bestx, besty, bestsize, biggest)
3936

40-
#print()
4137
return (bestx, besty, bestsize, biggest)
4238

4339
print("Part 1", find_best(3,3)[:2])

0 commit comments

Comments
 (0)