-
Category : JSP/Java
Tags :
- Update : 2015-12-29
- Size : 5kb
- Downloaded ：0次
- Author ：郑****
- About ：
Nobody
- PS : If download it fails, try it again. Download again for free!
Introduction - If you have any usage issues, please Google them yourself
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.
Packet file list
(Preview for download)
1\myjava\Josephus.java
.\......\LList.java
.\......\myjava\Josephus.class
.\......\......\LList.class
.\......\......\SeqList.class
.\......\myjava
.\......\SeqList.java
.\myjava
1
Related instructions
- We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
- The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
- Please use Winrar for decompression tools
- If download fail, Try it againg or Feedback to us.
- If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
- Before downloading, you can inquire through the uploaded person information