toni/zern
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

desguar += and -=

Browse Source
This commit is contained in:
Antoni Piasecki
2026-06-06 18:53:11 +02:00
parent 535364931e
commit 22874181cd
32 changed files with 185 additions and 146 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
examples/puzzles/aoc2024_01.zr
View File

@@ -2,7 +2,7 @@ func part1[l1: Array, l2: Array] : void
out := 0
for i in 0..l1->size
out = out + math.abs(array.nth(l1, i) - array.nth(l2, i))
out += math.abs(array.nth(l1, i) - array.nth(l2, i))
io.println_i64(out)
@@ -10,7 +10,7 @@ func part2[l1: Array, l2: Array] : void
out := 0
for i in 0..l1->size
out = out + array.nth(l1, i) * alg.count(l2, array.nth(l1, i))
out += array.nth(l1, i) * alg.count(l2, array.nth(l1, i))
io.println_i64(out)

6
examples/puzzles/aoc2024_02.zr
View File

@@ -18,7 +18,7 @@ func part1[data: Array] : void
for i in 0..data->size
if check(array.nth(data, i))
out = out + 1
out += 1
io.println_i64(out)
@@ -27,14 +27,14 @@ func part2[data: Array] : void
for i in 0..data->size
if check(array.nth(data, i))
out = out + 1
out += 1
else
arr : Array = array.nth(data, i)
for j in 0..arr->size
sliced := array.concat(array.slice(arr, 0, j), array.slice(arr, j + 1, arr->size - (j + 1)))
if check(sliced)
out = out + 1
out += 1
break
io.println_i64(out)

18
examples/puzzles/aoc2024_04.zr
View File

@@ -19,21 +19,21 @@ func part1[lines: Array] : void
for x in 0..lines->size
for y in 0..str.len(array.nth(lines, x))
if check(lines, x, y, 0, 1)
out = out + 1
out += 1
if check(lines, x, y, 0, -1)
out = out + 1
out += 1
if check(lines, x, y, 1, 0)
out = out + 1
out += 1
if check(lines, x, y, -1, 0)
out = out + 1
out += 1
if check(lines, x, y, 1, 1)
out = out + 1
out += 1
if check(lines, x, y, -1, -1)
out = out + 1
out += 1
if check(lines, x, y, 1, -1)
out = out + 1
out += 1
if check(lines, x, y, -1, 1)
out = out + 1
out += 1
io.println_i64(out)
@@ -51,7 +51,7 @@ func part2[lines: Array] : void
s[4] = 0
if str.equal(s, "MSSM") || str.equal(s, "SMMS") || str.equal(s, "MMSS") || str.equal(s, "SSMM")
out = out + 1
out += 1
io.println_i64(out)

4
examples/puzzles/aoc2024_05.zr
View File

@@ -31,7 +31,7 @@ func part1[updates: Array, rules_left: Array, rules_right: Array] : void
for i in 0..updates->size
update : Array = array.nth(updates, i)
if check(update, rules_left, rules_right)
out = out + array.nth(update, update->size / 2)
out += array.nth(update, update->size / 2)
io.println_i64(out)
@@ -42,7 +42,7 @@ func part2[updates: Array, rules_left: Array, rules_right: Array] : void
update : Array = array.nth(updates, i)
if !check(update, rules_left, rules_right)
sort_by_rules(update, rules_left, rules_right)
out = out + array.nth(update, update->size / 2)
out += array.nth(update, update->size / 2)
io.println_i64(out)

8
examples/puzzles/aoc2024_07.zr
View File

@@ -16,7 +16,7 @@ func solve[ops: Array, e: Array] : i64
op : str = array.nth(ops, array.nth(indices, i))
if str.equal(op, "add")
res = res + array.nth(e_1, i + 1)
res += array.nth(e_1, i + 1)
else if str.equal(op, "mul")
res = res * array.nth(e_1, i + 1)
else if str.equal(op, "concat")
@@ -33,7 +33,7 @@ func solve[ops: Array, e: Array] : i64
done = false
break
array.set(indices, i, 0)
i = i - 1
i -= 1
if done
return 0
@@ -42,7 +42,7 @@ func part1[equations: Array] : void
out := 0
for i in 0..equations->size
out = out + solve(["add", "mul"], array.nth(equations, i))
out += solve(["add", "mul"], array.nth(equations, i))
io.println_i64(out)
@@ -50,7 +50,7 @@ func part2[equations: Array] : void
out := 0
for i in 0..equations->size
out = out + solve(["add", "mul", "concat"], array.nth(equations, i))
out += solve(["add", "mul", "concat"], array.nth(equations, i))
io.println_i64(out)

18
examples/puzzles/aoc2025_01.zr
View File

@@ -8,16 +8,16 @@ func part1[lines: Array] : void
n := str.substr(line, 1, str.len(line) - 1) |> str.parse_i64()
if dir == 'L'
dial = dial - n
dial -= n
while dial < 0
dial = 100 + dial
dial += 100
else
dial = dial + n
dial += n
while dial >= 100
dial = dial - 100
dial -= 100
if dial == 0
password = password + 1
password += 1
io.println_i64(password)
@@ -32,17 +32,17 @@ func part2[lines: Array] : void
if dir == 'L'
for i in 0..n
dial = dial - 1
dial -= 1
if dial == 0
password = password + 1
password += 1
if dial == -1
dial = 99
else
for i in 0..n
dial = dial + 1
dial += 1
if dial == 100
dial = 0
password = password + 1
password += 1
io.println_i64(password)

4
examples/puzzles/aoc2025_02.zr
View File

@@ -18,7 +18,7 @@ func part1[ranges: Array] : void
for n in (start)..end+1
if part1_is_invalid_id(str.from_i64(n))
sum = sum + n
sum += n
io.println_i64(sum)
@@ -49,7 +49,7 @@ func part2[ranges: Array] : void
for n in (start)..end+1
if part2_is_invalid_id(str.from_i64(n))
sum = sum + n
sum += n
io.println_i64(sum)

4
examples/puzzles/aoc2025_03.zr
View File

@@ -15,7 +15,7 @@ func part1[lines: Array] : void
if n > largest
largest = n
sum = sum + largest
sum += largest
io.println_i64(sum)
// had to cheat this one
@@ -41,7 +41,7 @@ func part2[lines: Array] : void
for i in 0..lines->size
line : str = array.nth(lines, i)
sum = sum + part2_rec(line, 0, 12)
sum += part2_rec(line, 0, 12)
io.println_i64(sum)
func main[] : i64

2
examples/puzzles/euler_00.zr
View File

@@ -3,6 +3,6 @@ func main[] : i64
for i in 0..266000
if i % 2 != 0
sum = sum + i * i
sum += i * i
io.println_i64(sum)

2
examples/puzzles/euler_01.zr
View File

@@ -3,6 +3,6 @@ func main[] : i64
for i in 0..1000
if i % 5 == 0 || i % 3 == 0
sum = sum + i
sum += i
io.println_i64(sum)

4
examples/puzzles/euler_02.zr
View File

@@ -5,9 +5,9 @@ func main[] : i64
while a < 4000000
if a % 2 == 0
sum = sum + a
sum += a
temp := b
b = a + b
b += a
a = temp
io.println_i64(sum)

2
examples/puzzles/euler_03.zr
View File

@@ -6,6 +6,6 @@ func main[] : i64
if n % f == 0
n = n / f
else
f = f + 1
f += 1
io.println_i64(n)

4
examples/puzzles/euler_06.zr
View File

@@ -1,11 +1,11 @@
func main[] : i64
sum_of_squares := 0
for i in 1..101
sum_of_squares = sum_of_squares + i * i
sum_of_squares += i * i
square_of_sum := 0
for i in 1..101
square_of_sum = square_of_sum + i
square_of_sum += i
square_of_sum = square_of_sum * square_of_sum
io.println_i64(square_of_sum - sum_of_squares)

4
examples/puzzles/euler_07.zr
View File

@@ -4,8 +4,8 @@ func main[] : i64
i := 1
while true
if math.is_prime(i)
found = found + 1
found += 1
if found == 10001
io.println_i64(i)
break
i = i + 1
i += 1

2
examples/puzzles/euler_08.zr
View File

@@ -8,7 +8,7 @@ func main[] : i64
j := 0
while j < 13
s = s * (n[i + j] - '0')
j = j + 1
j += 1
if s > out
out = s
io.println_i64(out)

2
examples/puzzles/euler_10.zr
View File

@@ -3,5 +3,5 @@ func main[] : i64
for i in 0..2000000
if math.is_prime(i)
sum = sum + i
sum += i
io.println_i64(sum)

8
examples/puzzles/euler_12.zr
View File

@@ -4,18 +4,18 @@ func num_divisors[n: i64] : i64
out := 0
for i in 1..end+1
if n % i == 0
out = out + 2
out += 2
if end * end == n
out = out - 1
out -= 1
return out
func main[] : i64
n := 0
i := 1
while true
n = n + i
n += i
if num_divisors(n) > 500
io.println_i64(n)
break
i = i + 1
i += 1

2
examples/puzzles/euler_14.zr
View File

@@ -7,7 +7,7 @@ func collatz_seq[n: i64]: i64
i := 1
while n != 1
n = collatz_num(n)
i = i + 1
i += 1
return i
func main[] : i64

2
examples/puzzles/euler_16.zr
View File

@@ -14,6 +14,6 @@ func main[] : i64
sum := 0
for i in 0..n->size
sum = sum + array.nth(n, i)
sum += array.nth(n, i)
io.println_i64(sum)

16
examples/puzzles/euler_17.zr
View File

@@ -6,21 +6,21 @@ func main[] : i64
sum := 0
for i in 1..10
sum = sum + array.nth(s1, i)
sum += array.nth(s1, i)
for i in 0..10
sum = sum + array.nth(s2, i)
sum += array.nth(s2, i)
for i in 20..100
sum = sum + array.nth(s3, i / 10) + array.nth(s1, i % 10)
sum += array.nth(s3, i / 10) + array.nth(s1, i % 10)
for i in 1..10
sum = sum + array.nth(s1, i) + 7
sum += array.nth(s1, i) + 7
for j in 1..10
sum = sum + array.nth(s1, i) + 7 + 3 + array.nth(s1, j)
sum += array.nth(s1, i) + 7 + 3 + array.nth(s1, j)
for j in 0..10
sum = sum + array.nth(s1, i) + 7 + 3 + array.nth(s2, j)
sum += array.nth(s1, i) + 7 + 3 + array.nth(s2, j)
for j in 20..100
sum = sum + array.nth(s1, i) + 7 + 3 + array.nth(s3, j / 10) + array.nth(s1, j % 10)
sum += array.nth(s1, i) + 7 + 3 + array.nth(s3, j / 10) + array.nth(s1, j % 10)
sum = sum + array.nth(s1, 1) + 8
sum += array.nth(s1, 1) + 8
io.println_i64(sum)

2
examples/puzzles/euler_19.zr
View File

@@ -16,7 +16,7 @@ func main[] : i64
for year in 1901..2001
for mon in 1..13
if wday == 5
sun = sun + 1
sun += 1
wday = (wday + days(year, mon)) % 7
io.println_i64(sun)

2
examples/puzzles/euler_20.zr
View File

@@ -16,6 +16,6 @@ func main[] : i64
sum := 0
for i in 0..n->size
sum = sum + array.nth(n, i)
sum += array.nth(n, i)
io.println_i64(sum)

2
examples/puzzles/euler_21.zr
View File

@@ -16,6 +16,6 @@ func main[] : i64
for i in 2..10000
d := divisors_sum(i)
if i < d && i == divisors_sum(d)
sum = sum + i + d
sum += i + d
io.println_i64(sum)