RosettaCodeData/Task/Josephus-problem/Nanoquery/josephus-problem.nanoquery

17 lines
388 B
Plaintext

def j(n, k)
p = list(range(0, n-1))
i = 0
seq = {}
while len(p) > 0
i = (i+k-1) % len(p)
seq.append(p[i])
p.remove(i)
end
sur = seq[len(seq) - 1]; seq.remove(len(seq) - 1)
return format("Prisoner killing order: %s\nSurvivor: %d", seq, sur)
end
println j(5,2)
println
println j(41,3)