-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.nim
62 lines (48 loc) · 1.05 KB
/
solution.nim
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
import std/[
algorithm,
bitops,
deques,
intsets,
json,
math,
re,
sequtils,
sets,
strformat,
strutils,
tables,
sugar,
]
proc parse(input: string): seq[int] =
input.split("\n").mapIt(it.parseInt)
proc run(a: seq[int]): int =
a.sum
when defined(test):
block:
doAssert run(@[+1, -2, +3, +1]) == 3
doAssert run(@[+1, +1, +1]) == 3
doAssert run(@[+1, +1, -2]) == 0
doAssert run(@[-1, -2, -3]) == -6
proc part1(input: string): int =
input.parse.run
proc run2(a: seq[int]): int =
var seen = initIntSet()
var x, i = 0
while x notin seen:
seen.incl x
x += a[i]
i = (i + 1) mod a.len
x
when defined(test):
block:
doAssert run2(@[+1, -2, +3, +1]) == 2
doAssert run2(@[+1, -1]) == 0
doAssert run2(@[+3, +3, +4, -2, -4]) == 10
doAssert run2(@[-6, +3, +8, +5, -6]) == 5
doAssert run2(@[+7, +7, -2, -7, -4]) == 14
proc part2(input: string): int =
input.parse.run2
when isMainModule and not defined(test):
let input = readAll(stdin).strip
echo part1(input)
echo part2(input)