Josephus problem modified

Let's talk about algorithms!

Moderator: Board moderators

Post Reply
temper_3243
Experienced poster
Posts: 105
Joined: Wed May 25, 2005 7:23 am

Josephus problem modified

Post by temper_3243 » Sun Jun 12, 2005 10:20 am

Hi,

There are 2n people sitting in a circle . The first n are good and next n are bad. Now i have to choose minimum k such that all the bad n are eliminated before the first n. How do i find such k.

Please point me to links or documents ? Is there any recursive formula ?

Regards,
Terry

frk_styc
New poster
Posts: 10
Joined: Sun Apr 17, 2005 5:00 pm

Re: Josephus problem modified

Post by frk_styc » Fri Jun 17, 2005 6:54 pm

temper_3243 wrote:Hi,

There are 2n people sitting in a circle . The first n are good and next n are bad. Now i have to choose minimum k such that all the bad n are eliminated before the first n. How do i find such k.

Please point me to links or documents ? Is there any recursive formula ?

Regards,
Terry
a problem from cerc 1995. enumerating every possible k will do.

Post Reply

Return to “Algorithms”