← 返回题目

题库练习 Permutations

← 上一题下一题 →

A8333 | $Permutations$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

输出 #1

输入 #2

输出 #2

输入 #3

输出 #3

C++ 编辑器

输入

输出