Description: Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
- [qp] - This procedure is based on the schedulin
- [decrypaddtion] - encrypaddtion Adder and encryption suppo
- [Josephus] - Josephus with the problem are defined as
File list (Check if you may need any files):
Download