Description: The Josephus problem.Assuming n students sit in a ring.we start count from the first student.when we count m,the student who has the number of m musts leave.wo now ask the last one s number.
To Search:
File list (Check if you may need any files):
Josephus problem.doc
Download