From b9e7fa86d5fad16b04c3cf44e64dcc8d6b1fe3de Mon Sep 17 00:00:00 2001 From: fredrikr79 Date: Mon, 22 Sep 2025 00:46:47 +0200 Subject: [PATCH] solve 26 in uiua (FAST) --- 26/main.ua | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 26/main.ua diff --git a/26/main.ua b/26/main.ua new file mode 100644 index 0000000..a979b14 --- /dev/null +++ b/26/main.ua @@ -0,0 +1,14 @@ +# project euler 26 + +# divide a by b, doing one iteration of long division. +# ? b a +Div ← ×10-⊸(×⌊⤚÷) + +# we will have to perform long division at most 1000 +# times, so just do it 1000 times for all numbers +# below 1000, pervasively. +# use the steps to determine cycle lengths. + +1000 +⍥⟜⊸Div⟜⊃⇡(↯⊙1) # pervasively repeat long division. +⊢⊚=⊸/↥≡(⧻◴)⍉ # cycle length is dedup length.