Introduction - If you have any usage issues, please Google them yourself
Given any positive integer n, k, can be obtained as described below arrangement 1,2, ......, a permutation of n: the digital 1,2, ......, n arranged in a ring (as shown in Figure 2-36), press Clockwise 1 starts counting, output figures in this position (and delete the number the ring) at the expiration of k, then resumes counting the next number, until all numbers are output in the ring so far. Try to write an algorithm to enter any positive integer n, k, outputs a corresponding displacement sequence of numbers.