-
Notifications
You must be signed in to change notification settings - Fork 0
/
10.py
54 lines (41 loc) · 1.21 KB
/
10.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
from utils import readFile
import math
lines = readFile('inputs/inputTask10.txt')
lines = [int(line) for line in lines]
print(lines)
#for line in lines:
#print(line)
def FindChain(lines):
singleHop = 1
doubleHop = 2
tripleHop = 3
numSingleHop = 0
numDoubleHop = 0
numTripleHop = 0
deviceJolts = 3
minJolt = min(lines)
maxJolt = max(lines)
current = minJolt
if current == 1:
numSingleHop = numSingleHop + 1
elif current == 2:
numDoubleHop = numDoubleHop + 1
elif current == 3:
numTripleHop = numTripleHop + 1
for line in lines:
if current == maxJolt:
numTripleHop = numTripleHop + 1
total = numSingleHop * numTripleHop
return total
if (current + singleHop) in lines:
current = current + singleHop
numSingleHop = numSingleHop + 1
elif (current + doubleHop) in lines:
current = current + doubleHop
numDoubleHop = numDoubleHop + 1
elif (current + tripleHop) in lines:
current = current + tripleHop
numTripleHop = numTripleHop + 1
else:
return False
print(FindChain(lines))