RosettaCodeData/Task/Josephus-problem/Ruby/josephus-problem.rb

n = (ARGV[0] || 41).to_i
k = (ARGV[1] || 3).to_i

prisoners = (0...n).to_a
prisoners.rotate!(k-1).shift  while prisoners.length > 1
puts prisoners.first
September 2017 Update 2017-09-23 10:01:46 +02:00			`n = (ARGV[0] \|\| 41).to_i`
			`k = (ARGV[1] \|\| 3).to_i`
A-M baby 2013-04-10 21:29:02 -07:00
September 2017 Update 2017-09-23 10:01:46 +02:00			`prisoners = (0...n).to_a`
			`prisoners.rotate!(k-1).shift while prisoners.length > 1`
			`puts prisoners.first`