RosettaCodeData/Task/Josephus-problem/Common-Lisp/josephus-problem-1.lisp

5 lines
104 B
Common Lisp

(defun kill (n k &aux (m 0))
(loop for a from (1+ m) upto n do
(setf m (mod (+ m k) a)))
m)