HDU 6351 Beautiful Now(全排列枚举)

Problem Description

Anton has a positive integer n, however, it quite looks like a mess, so he wants to make it beautiful after k swaps of digits.
Let the decimal representation of n as (x1x2⋯xm)10 satisfying that 1≤x1≤9, 0≤xi≤9 (2≤i≤m), which means n=∑mi=1xi10m−i. In each swap, Anton can select two digits xi and xj (1≤i≤j≤m) and then swap them if the integer after this swap has no leading zero.
Could you please tell him the minimum integer and the maximum integer he can obtain after k swaps?

 

 

Input

The first line contains one integer T, indicating the number of test cases.
Each of the following T lines describes a test case and contains two space-separated integers n and k.
1≤T≤100, 1≤n,k≤109.

 

 

Output

For each test case, print in one line the minimum integer and the maximum integer which are separated by one space.

 

 

Sample Input

5 12 1 213 2 998244353 1 998244353 2 998244353 3

 

 

Sample Output

12 21 123 321 298944353 998544323 238944359 998544332 233944859 998544332

 

 

Source

2018 Multi-University Training Contest 5

题意：给定一个数，和一个最多交换次数k，问在不超过k次操作的情况，问可以得到的最大值和最小值是多少？

思路：保存下标，全排列枚举下标。

难点：对于每次的排列，如何确定它的交换次数？看循环结的个数就行！

具体看代码：

#include 
#include 
#include 
#include 
#include 
#include