giles
76de0a20f8
Test, Build, and Deploy / test-build-deploy (push) Failing after 22s
ocaml: phase 5.1 josephus.ml baseline (n=50 k=3, survivor at position 11)
...
Classic Josephus problem solved with the standard recurrence:
let rec josephus n k =
if n = 1 then 0
else (josephus (n - 1) k + k) mod n
josephus 50 3 + 1 = 11
50 people stand in a circle, every 3rd is eliminated; the last
survivor is at position 11 (1-indexed). Tests recursion + mod.
136 baseline programs total.
2026-05-10 03:22:29 +00:00
..
2026-05-07 11:31:17 +00:00
2026-05-06 09:19:56 +00:00
2026-05-07 19:33:09 +00:00
2026-05-05 12:35:26 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 09:19:56 +00:00
2026-04-25 08:06:17 +00:00
2026-04-24 16:03:00 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 17:40:53 +00:00
2026-05-06 17:02:02 +00:00
2026-04-25 08:54:05 +00:00
2026-05-06 09:19:56 +00:00
2026-05-06 15:17:43 +00:00
2026-04-26 17:54:34 +00:00
2026-04-25 18:35:32 +00:00
2026-05-06 09:19:56 +00:00
2026-05-07 19:45:23 +00:00
2026-04-24 16:03:00 +00:00
2026-05-06 09:19:56 +00:00
2026-05-10 03:22:29 +00:00
2026-05-06 09:19:56 +00:00
2026-04-24 15:16:45 +00:00
2026-04-23 19:42:16 +00:00
2026-05-01 20:20:56 +00:00
2026-04-25 16:32:26 +00:00
2026-05-07 02:38:57 +00:00
2026-05-06 11:06:05 +00:00
2026-05-07 18:29:20 +00:00