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 19:33:09 +00:00
2026-05-06 23:00:12 +00:00
2026-05-06 22:01:51 +00:00
2026-05-01 23:30:48 +00:00
2026-05-07 19:45:10 +00:00
2026-05-06 22:46:48 +00:00
2026-05-07 01:20:32 +00:00
2026-05-01 22:33:27 +00:00
2026-05-07 17:17:17 +00:00
2026-05-10 03:22:29 +00:00
2026-05-07 17:35:49 +00:00
2026-05-01 23:18:04 +00:00
2026-05-06 22:01:51 +00:00
2026-05-07 18:29:26 +00:00
2026-04-02 12:50:35 +00:00
2026-04-03 21:48:54 +00:00
2026-04-03 21:48:54 +00:00
2026-05-07 02:38:47 +00:00
2026-04-03 21:48:54 +00:00
2026-05-06 16:58:18 +00:00
2026-04-04 20:49:02 +00:00
2026-04-22 09:08:00 +00:00
2026-04-22 09:08:00 +00:00
2026-04-04 20:49:02 +00:00
2026-04-11 08:03:45 +00:00
2026-05-01 21:00:22 +00:00
2026-04-03 21:48:54 +00:00
2026-04-11 08:19:16 +00:00
2026-04-03 21:48:54 +00:00
2026-04-04 20:49:02 +00:00
2026-04-12 18:31:34 +00:00
2026-04-04 20:49:02 +00:00
2026-04-04 20:49:02 +00:00
2026-04-08 10:12:57 +00:00