题库
比赛
近期比赛
话题
编译器
报文仓库
登录
题目描述
题解
我的提交
1072.Permutations
查看全部提交
提交状态
耗时
内存
语言
提交时间
1072.Permutations
时间限制:1000MS 内存限制:65535KB
题目描述
You are given n k-digit integers. You have to rearrange the digits in the integers so that the difference between the largest and the smallest number was minimum. Digits should be rearranged by the same rule in all integers.
输入描述
The input consists of several test cases. The first line contains integers n and k --- the number and digit capacity of numbers correspondingly (1≤n,k≤8). Next n lines contain k-digit positive integers. Leading zeroes are allowed both in the initial integers and the integers resulting from the rearranging of digits. Process to the end of file.
输出描述
Print a single number: the minimally possible difference between the largest and the smallest number after the digits are rearranged in all integers by the same rule.
示例
输入样例
6 4 5237 2753 7523 5723 5327 2537 3 3 010 909 012
输出样例
2700 3
提示
相关标签
brute force
combinatorics
implementation
发布题解
个题解
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
登陆后才可以提交
测试输入
执行结果
6 4 5237 2753 7523 5723 5327 2537 3 3 010 909 012
请先执行代码
控制台
代码编辑器配置
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题,选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数,设置为0则不限制。
0
80
100
120