-
Notifications
You must be signed in to change notification settings - Fork 0
/
days_1_to_4.py
175 lines (134 loc) · 4.03 KB
/
days_1_to_4.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
import numpy as np
# day 1
def calc_module_fuel(module_weight):
total = module_weight
cur = module_weight
while True:
cur = int(np.floor(cur/3)-2)
if cur<=0:
break
total+=cur
return total
# part 1:
f=open('input1.txt','r')
txt = f.read()
txt = txt.split('\n')
txt = txt[:-1]
total = sum([int(np.floor(int(item)/3)-2) for item in txt])
# part 2:
total_with_fuel = sum([calc_module_fuel(int(np.floor(int(item)/3)-2)) for item in txt])
# day 2
# part 1:
f=open('input2.txt','r')
txt = f.read()
txt = txt.split('\n')
txt = txt[0].split(',')
nums = [int(item) for item in txt]
nums[1]=12
nums[2]=2
for i in range(0, len(nums), 4):
if nums[i]==99:
break
if nums[i]==1:
nums[nums[i+3]] = nums[nums[i+1]]+nums[nums[i+2]]
if nums[i]==2:
nums[nums[i+3]] = nums[nums[i+1]]*nums[nums[i+2]]
# part 2:
for noun in range(100):
for verb in range(100):
nums = [int(item) for item in txt]
nums[1] = noun
nums[2] = verb
for i in range(0, len(nums), 4):
if nums[i]==99:
break
if nums[i]==1:
nums[nums[i+3]] = nums[nums[i+1]]+nums[nums[i+2]]
if nums[i]==2:
nums[nums[i+3]] = nums[nums[i+1]]*nums[nums[i+2]]
if nums[0]==19690720:
print('noun=' + str(noun))
print('verb=' + str(verb))
break
# day 3:
# part 1:
def calc_wire_path(wire):
# not very efficient... :( but works
path = [(0,0)] # x,y convention
for item in wire:
if item[0] == 'L':
path += [(path[-1][0]-n, path[-1][1]) for n in range(1,int(item[1:])+1)]
#path.append((path[-1][0]-int(item[1:]), path[-1][1]))
elif item[0] == 'R':
path += [(path[-1][0]+n, path[-1][1]) for n in range(1,int(item[1:])+1)]
#path.append((path[-1][0]+int(item[1:]), path[-1][1]))
elif item[0] == 'U':
path += [(path[-1][0], path[-1][1]+n) for n in range(1,int(item[1:])+1)]
#path.append((path[-1][0], path[-1][1]+int(item[1:])))
elif item[0] == 'D':
path += [(path[-1][0], path[-1][1]-n) for n in range(1,int(item[1:])+1)]
#path.append((path[-1][0], path[-1][1]-int(item[1:])))
return path
def closest_point(points):
min_dist = abs(points[0][0]) + abs(points[0][1])
for p in points:
dist = abs(p[0]) + abs(p[1])
if dist<min_dist:
min_dist = dist
return min_dist
def fastest_point(points, path1, path2):
min_time = len(path1) + len(path2)
for p in points:
t = path1.index(p) + path2.index(p)
if t<min_time:
min_time = t
return min_time
f=open('input3.txt','r')
txt=f.read()
txt = txt.split('\n')
txt=txt[:-1]
wire1 = txt[0].split(',')
wire2 = txt[1].split(',')
wire1_path = calc_wire_path(wire1)
wire2_path = calc_wire_path(wire2)
inter_points = list(set(wire1_path).intersection(wire2_path))
inter_points.remove((0,0))
min_dist = closest_point(inter_points)
print('min_dist=' + str(min_dist))
# part 2
min_time = fastest_point(inter_points, wire1_path, wire2_path)
print('min_time = ' + str(min_time))
# day 4:
# part 1 & 2:
def two_adjacent_digits(num):
s = str(num)
for i in range(len(s)-1):
if s[i]==s[i+1]:
return True
return False
def exactly_two_adjacent_digits(num):
# for part 2
s = str(num)
cnt_adjacent = 0
for i in range(len(s)-1):
if s[i]==s[i+1]:
cnt_adjacent+=1
else:
if cnt_adjacent==1:
return True
else:
cnt_adjacent=0
print(cnt_adjacent)
return cnt_adjacent==1
def increasing_only(num):
s = str(num)
for i in range(len(s)-1):
if s[i]>s[i+1]:
return False
return True
range_val = [353096, 843212]
cnt=0
for num in range(range_val[0], range_val[1]+1):
if two_adjacent_digits(num) and increasing_only(num) and exactly_two_adjacent_digits(num):
cnt+=1
print(str(cnt) + ' passwords meet criteria')