RosettaCodeData/Task/Josephus-problem/11l/josephus-problem.11l

12 lines
260 B
Text
Raw Permalink Normal View History

2023-07-01 11:58:00 -04:00
F j(n, k)
V p = Array(0 .< n)
V i = 0
[Int] seq
L !p.empty
i = (i + k - 1) % p.len
seq.append(p.pop(i))
R "Prisoner killing order: #..\nSurvivor: #.".format(seq[0 .< (len)-1].join(, ), seq.last)
print(j(5, 2))
print(j(41, 3))