day10 in python???? wtf

Author: encse

2025/Day10/README.md

@@ -0,0 +1,6 @@
+## --- Day 10: Factory ---
+Just across the hall, you find a large factory. Fortunately, the Elves here have plenty of time to decorate. Unfortunately, it's because the factory machines are all offline, and none of the Elves can figure out the initialization procedure.
+
+The Elves do have the manual for the machines, but the section detailing the initialization procedure was eaten by a [Shiba Inu](https://en.wikipedia.org/wiki/Shiba_Inu). All that remains of the manual are some indicator light diagrams, button wiring schematics, and [joltage](3) requirements for each machine.
+
+_Visit the website for the full story and [full puzzle](https://adventofcode.com/2025/day/10) description._

2025/Day10/Solution.cs

@@ -0,0 +1,145 @@
+namespace AdventOfCode.Y2025.Day10;
+
+using System;
+using System.Collections;
+using System.Collections.Generic;
+using System.Collections.Immutable;
+using System.Linq;
+using System.Text.RegularExpressions;
+using System.Text;
+using System.Numerics;
+using AdventOfCode.Model;
+using System.Security.Cryptography;
+using AngleSharp.Html.Dom.Events;
+
+record Problem(int target, int[] buttons, int[] jolts);
+
+[ProblemName("Factory")]
+class Solution : Solver {
+
+    public object PartOne(string input) {
+        var res = 0;
+        foreach (var p in Parse(input)) {
+            var limit = 1 << p.buttons.Length;
+            var tries = Enumerable.Range(0, limit).OrderBy(BitCount).ToArray();
+
+            var q = -1;
+            foreach (var n in tries) {
+                if ((Xor(p.buttons, n) ^ p.target) == 0) {
+                    q = n;
+                    break;
+                }
+            }
+            if (q == -1) {
+                throw new Exception();
+            }
+            res += BitCount(q);
+        }
+        return res;
+    }
+
+
+    public object PartTwo(string input) {
+        var res = 0L;
+        var i = 1;
+        foreach (var p in Parse(input)) {
+            Console.WriteLine(i +  " " + p.buttons.Length + " " + p.jolts.Length);
+            i++;
+        }
+        return res;
+    }
+
+    bool TooMuch(Problem p, int[] state) {
+        return Enumerable.Range(0, state.Length).Any(i => state[i] > p.jolts[i]);
+    }
+
+    int Xor(int[] buttons, int mask) {
+        var res = 0;
+        var i = 0;
+        while (mask != 0) {
+            if ((mask & 1) != 0) {
+                res ^= buttons[i];
+            }
+            mask >>= 1;
+            i++;
+        }
+        return res;
+    }
+
+    int Solve(Problem p, int pushes, int[] state) {
+        if (pushes > 11) {
+            return int.MaxValue;
+        }
+
+        if (Array.Equals(state, p.jolts)) {
+            return pushes;
+        }
+
+        if (Enumerable.Range(0, state.Length).Any(i => state[i] > p.jolts[i])) {
+            return int.MaxValue;
+        } 
+
+        var res = int.MaxValue;
+        for (int i = 0; i < p.buttons.Length; i++) {
+            var stateT = Push(state, p.buttons[i]);
+            var m = Solve(p, pushes + 1, stateT);
+            if (m < res) {
+                res = m;
+            }
+        }
+        return res;
+    }
+
+    int[] Push(int[] state, int button) {
+        var res = state.ToArray();
+        for (int i = 0; i < state.Length; i++) {
+            if ((button & (1 << i)) != 0) {
+                res[i]++;
+            }
+        }
+        return res;
+    }
+
+    int BitCount(int n) {
+        int res = 0;
+        while (n != 0) {
+            n &= n - 1;
+            res++;
+        }
+        return res;
+    }
+
+    // [.##.] (3) (1,3) (2) (2,3) (0,2) (0,1) {3,5,4,7}
+    IEnumerable<Problem> Parse(string input) {
+        var lines = input.Split("\n");
+        foreach (var line in lines) {
+            var parts = line.Split(" ").ToArray();
+            var num = Convert.ToInt32(
+                string.Join("",
+                    parts.First()
+                        .Replace("[", "")
+                        .Replace("]", "")
+                        .Replace('.', '0')
+                        .Replace('#', '1')
+                        .Reverse()
+                ),
+                2);
+
+            var buttons =
+                from part in parts[1..^1]
+                let digits = Regex.Matches(part, @"\d").Select(m => int.Parse(m.Value))
+                let mask = (from d in digits select 1 << d).Sum()
+                select mask;
+
+            var jolts =
+                    parts.Last()
+                        .Replace("{", "")
+                        .Replace("}", "")
+                        .Split(",")
+                        .Select(int.Parse);
+            ;
+            yield return new Problem(num, buttons.ToArray(), jolts.ToArray());
+        }
+    }
+
+}