/* package whatever; // don't place package name! */ import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class Ideone { static public void findPermutation(int n, int k) { int[] numbers = new int[n]; int[] indices = new int[n]; // initialise the numbers 1, 2, 3... for (int i = 0; i < n; i++) numbers[i] = i + 1; int divisor = 1; for (int place = 1; place <= n; place++) { if((k / divisor) == 0) break; // all the remaining indices will be zero // compute the index at that place: indices[n-place] = (k / divisor) % place; divisor *= place; } // print out the indices: // System.out.println(Arrays.toString(indices)); // permute the numbers array according to the indices: for (int i = 0; i < n; i++) { int index = indices[i] + i; // take the element at index and place it at i, moving the rest up if(index != i) { int temp = numbers[index]; for(int j = index; j > i; j--) numbers[j] = numbers[j-1]; numbers[i] = temp; } } } { // your code goes here for(int i = 0; i < 6; i++) findPermutation(3, i); findPermutation(100, 10000000-1); } }
Standard input is empty
[1, 2, 3] [1, 3, 2] [2, 1, 3] [2, 3, 1] [3, 1, 2] [3, 2, 1] [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 92, 98, 96, 90, 91, 100, 94, 97, 95, 99, 93]