Description: In a positive integer n, i, k as an input, wherein n, i, k> 0, and i <n. Assuming that the number 1,2, ..., n is an annular array. Try to write a program, starting number i, k clockwise direction increments the number of prints, when printing a number, this number should ring deleted, this process has been carried out to the ring empty. For example, when n = 10, i = 1, k = 3, the output sequence is obtained 3,6,9,2,7,1,8,5,10,4.
To Search:
File list (Check if you may need any files):
1\myjava\Josephus.java
.\......\LList.java
.\......\myjava\Josephus.class
.\......\......\LList.class
.\......\......\SeqList.class
.\......\myjava
.\......\SeqList.java
.\myjava
1
Download