hdu 6351 Beautiful Now

最新推荐文章于 2019-04-14 13:20:20 发布

YVVVVY

最新推荐文章于 2019-04-14 13:20:20 发布

阅读量425

点赞数

分类专栏： dfs 文章标签： dfs

本文链接：https://blog.csdn.net/YVVVVY/article/details/81482333

版权

Given a positive integer n and an integer k, determine the minimum and maximum numbers that can be obtained after at most k swaps of digits. Constraints: 1≤T≤100, 1≤n,k≤109." 111800729,10296400,清理残留IE加载项，提升浏览器性能,"['IE浏览器', '浏览器插件', '系统优化', '安全防护']

摘要由CSDN通过智能技术生成

Beautiful Now

Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1721 Accepted Submission(s): 646

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