Description: Joseph Central questions: any given positive integer N and K, the following methods can be 1,2, ..., n a replacement, the number 1,2, ..., n the ring with, according to a clockwise direction from 1 to start off , K report output figures on the location and make it a column. And then in a clockwise direction from him the next figures to continue to count off, so until all the numbers all out of date. For example, N = 10, K = 3, then the correct order of the column should be 3,6,9,2,7,1,8,5,10,4.
File list (Check if you may need any files):
约瑟夫环.txt