CF124B.Permutations

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 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.

输出格式

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.

输入输出样例

输入#1
```
6 4
5237
2753
7523
5723
5327
2537
```
输出#1
```
2700
```
输入#2
```
3 3
010
909
012
```
输出#2
```
3
```

输入#3

输出#3

说明/提示

In the first sample, if we rearrange the digits in numbers as (3,1,4,2), then the 2-nd and the 4-th numbers will equal 5237 and 2537 correspondingly (they will be maximum and minimum for such order of digits).

In the second sample, if we swap the second digits and the first ones, we get integers 100, 99 and 102.

首页