Description: Josephus with the problem are defined as follows: Suppose n a player lined up a ring. Given a positive integer m, from a designated section 1 begins with individuals along the ring count, the first m individuals, when confronted by their let out, and the count continued. This process until all the listed date. Finally a column for the winners. Each person listed in the order of the definition of the integers 1,2, ..., n an order. This arrangement is called a (n, m) Josephus arranged. For example, (7,3) Josephus arranged for 3,6,2,7,5,1,4. For a given 1,2, ..., n in the k number, Josephus would like to know whether there is a positive integer m makes (n, m) Josephus with the final number of exactly k pre-designated number of this k.
To Search:
- [stacks] - Scheduling in a train station, a track c
- [4] - Order to minimize the cost of spanning t
File list (Check if you may need any files):
Download