solve 43 in uiua

2025-09-01 08:41:17 +02:00
parent 282763e951
commit df6b1a842e
1 changed files with 8 additions and 0 deletions
@@ -0,0 +1,8 @@
 # project euler 43
 p ← [2 3 5 7 11 13 17]
 # joins digits in 3-window and checks for divisibility with p
 # digit_array ? bool
 s ← =0/↥ ◿p ⋕⧈₃(/⊂≡°⋕) ↘1
 ⧅≠∞ ⇡10     # all pandigital permutations
 ▽⊸≡s        # keep all that satisfy prime divisibility
 /+⋕≡(/⊂≡°⋕) # collect digits, sum