From 56823189151ae5f29af74d51f33d2f32cc7a3de2 Mon Sep 17 00:00:00 2001 From: Toni Date: Tue, 23 Dec 2025 17:48:30 +0100 Subject: [PATCH] rewrite smarter people's euler solutions --- examples/puzzles/euler_11.zr | 36 ++++++++++++++++++++++++++++++++++++ examples/puzzles/euler_16.zr | 19 +++++++++++++++++++ examples/puzzles/euler_17.zr | 26 ++++++++++++++++++++++++++ examples/puzzles/euler_18.zr | 28 ++++++++++++++++++++++++++++ examples/puzzles/euler_19.zr | 22 ++++++++++++++++++++++ examples/puzzles/euler_20.zr | 21 +++++++++++++++++++++ examples/puzzles/euler_21.zr | 21 +++++++++++++++++++++ 7 files changed, 173 insertions(+) create mode 100644 examples/puzzles/euler_11.zr create mode 100644 examples/puzzles/euler_16.zr create mode 100644 examples/puzzles/euler_17.zr create mode 100644 examples/puzzles/euler_18.zr create mode 100644 examples/puzzles/euler_19.zr create mode 100644 examples/puzzles/euler_20.zr create mode 100644 examples/puzzles/euler_21.zr diff --git a/examples/puzzles/euler_11.zr b/examples/puzzles/euler_11.zr new file mode 100644 index 0000000..b5f750d --- /dev/null +++ b/examples/puzzles/euler_11.zr @@ -0,0 +1,36 @@ +func main[] : i64 + let N: i64 = 20 + + let grid: array = [] + array.push(grid, [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8]) + array.push(grid, [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0]) + array.push(grid, [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65]) + array.push(grid, [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91]) + array.push(grid, [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80]) + array.push(grid, [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50]) + array.push(grid, [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70]) + array.push(grid, [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21]) + array.push(grid, [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72]) + array.push(grid, [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95]) + array.push(grid, [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92]) + array.push(grid, [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57]) + array.push(grid, [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58]) + array.push(grid, [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40]) + array.push(grid, [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66]) + array.push(grid, [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69]) + array.push(grid, [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36]) + array.push(grid, [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16]) + array.push(grid, [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54]) + array.push(grid, [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]) + + let out: i64 = 0 + + for i in 0..N-3 + for j in 0..N-3 + let h: i64 = array.nth(array.nth(grid, i), j) * array.nth(array.nth(grid, i), j+1) * array.nth(array.nth(grid, i), j+2) * array.nth(array.nth(grid, i), j+3) + let v: i64 = array.nth(array.nth(grid, j), i) * array.nth(array.nth(grid, j+1), i) * array.nth(array.nth(grid, j+2), i) * array.nth(array.nth(grid, j+3), i) + let d1: i64 = array.nth(array.nth(grid, i), j) * array.nth(array.nth(grid, i+1), j+1) * array.nth(array.nth(grid, i+2), j+2) * array.nth(array.nth(grid, i+3), j+3) + let d2: i64 = array.nth(array.nth(grid, i), N-j-1) * array.nth(array.nth(grid, i+1), N-j-2) * array.nth(array.nth(grid, i+2), N-j-3) * array.nth(array.nth(grid, i+3), N-j-4) + out = math.max(out, math.max(h, math.max(v, math.max(d1, d2)))) + + io.println_i64(out) \ No newline at end of file diff --git a/examples/puzzles/euler_16.zr b/examples/puzzles/euler_16.zr new file mode 100644 index 0000000..3c247ab --- /dev/null +++ b/examples/puzzles/euler_16.zr @@ -0,0 +1,19 @@ +func main[] : i64 + let n: array = [] + array.push(n, 1) + + for j in 0..1000 + let carry: i64 = 0 + for i in 0..array.size(n) + let tmp: i64 = array.nth(n, i) * 2 + carry + array.set(n, i, tmp % 10) + carry = tmp / 10 + while carry > 0 + array.push(n, carry % 10) + carry = carry / 10 + + let sum: i64 = 0 + for i in 0..array.size(n) + sum = sum + array.nth(n, i) + + io.println_i64(sum) diff --git a/examples/puzzles/euler_17.zr b/examples/puzzles/euler_17.zr new file mode 100644 index 0000000..c0248ac --- /dev/null +++ b/examples/puzzles/euler_17.zr @@ -0,0 +1,26 @@ +func main[] : i64 + let s1: array = [0, 3, 3, 5, 4, 4, 3, 5, 5, 4] + let s2: array = [3, 6, 6, 8, 8, 7, 7, 9, 8, 8] + let s3: array = [0, 0, 6, 6, 5, 5, 5, 7, 6, 6] + + let sum: i64 = 0 + + for i in 1..10 + sum = sum + array.nth(s1, i) + for i in 0..10 + sum = sum + array.nth(s2, i) + for i in 20..100 + sum = sum + array.nth(s3, i / 10) + array.nth(s1, i % 10) + + for i in 1..10 + sum = sum + array.nth(s1, i) + 7 + for j in 1..10 + sum = 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) + for j in 20..100 + sum = sum + array.nth(s1, i) + 7 + 3 + array.nth(s3, j / 10) + array.nth(s1, j % 10) + + sum = sum + array.nth(s1, 1) + 8 + + io.println_i64(sum) \ No newline at end of file diff --git a/examples/puzzles/euler_18.zr b/examples/puzzles/euler_18.zr new file mode 100644 index 0000000..9ae77d1 --- /dev/null +++ b/examples/puzzles/euler_18.zr @@ -0,0 +1,28 @@ +func findmax[triangle: array, row: i64, col: i64] : i64 + if row == 14 + return array.nth(array.nth(triangle, row), col) + + let left: i64 = findmax(triangle, row + 1, col) + let right: i64 = findmax(triangle, row + 1, col + 1) + + return array.nth(array.nth(triangle, row), col) + math.max(left, right) + +func main[] : i64 + let triangle: array = [] + array.push(triangle, [75]) + array.push(triangle, [95, 64]) + array.push(triangle, [17, 47, 82]) + array.push(triangle, [18, 35, 87, 10]) + array.push(triangle, [20, 4, 82, 47, 65]) + array.push(triangle, [19, 1, 23, 75, 3, 34]) + array.push(triangle, [88, 2, 77, 73, 7, 63, 67]) + array.push(triangle, [99, 65, 4, 28, 6, 16, 70, 92]) + array.push(triangle, [41, 41, 26, 56, 83, 40, 80, 70, 33]) + array.push(triangle, [41, 48, 72, 33, 47, 32, 37, 16, 94, 29]) + array.push(triangle, [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14]) + array.push(triangle, [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57]) + array.push(triangle, [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48]) + array.push(triangle, [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31]) + array.push(triangle, [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23]) + + io.println_i64(findmax(triangle, 0, 0)) diff --git a/examples/puzzles/euler_19.zr b/examples/puzzles/euler_19.zr new file mode 100644 index 0000000..984d7ac --- /dev/null +++ b/examples/puzzles/euler_19.zr @@ -0,0 +1,22 @@ +func days[y: i64, m: i64] : i64 + if m == 2 + if (((y % 4 == 0) & (y % 100 != 0)) | (y % 400 == 0)) + return 29 + else + return 28 + else if (m == 4) | (m == 6) | (m == 9) | (m == 11) + return 30 + else + return 31 + +func main[] : i64 + let wday: i64 = 0 + let sun: i64 = 0 + + for year in 1901..2001 + for mon in 1..13 + if wday == 5 + sun = sun + 1 + wday = (wday + days(year, mon)) % 7 + + io.println_i64(sun) \ No newline at end of file diff --git a/examples/puzzles/euler_20.zr b/examples/puzzles/euler_20.zr new file mode 100644 index 0000000..ccd8d9b --- /dev/null +++ b/examples/puzzles/euler_20.zr @@ -0,0 +1,21 @@ +func multiply[n: array, x: i64] : void + let carry: i64 = 0 + for i in 0..array.size(n) + let prod: i64 = array.nth(n, i) * x + carry + array.set(n, i, prod % 10) + carry = prod / 10 + while carry > 0 + array.push(n, carry % 10) + carry = carry / 10 + +func main[] : i64 + let n: array = [1] + + for i in 2..101 + multiply(n, i) + + let sum: i64 = 0 + for i in 0..array.size(n) + sum = sum + array.nth(n, i) + + io.println_i64(sum) \ No newline at end of file diff --git a/examples/puzzles/euler_21.zr b/examples/puzzles/euler_21.zr new file mode 100644 index 0000000..39b7b8d --- /dev/null +++ b/examples/puzzles/euler_21.zr @@ -0,0 +1,21 @@ +func divisors_sum[n: i64] : i64 + let k: i64 = n + let sum: i64 = 1 + + for i in 2..k+1 + let p: i64 = 1 + while k % i == 0 + p = p * i + k = k / i + sum = sum * (p * i - 1) / (i - 1) + return sum - n + +func main[] : i64 + let sum: i64 = 0 + + for i in 2..10000 + let d: i64 = divisors_sum(i) + if i < d & i == divisors_sum(d) + sum = sum + i + d + + io.println_i64(sum) \ No newline at end of file