Problems
Contests
Topic
IDE
Events
PacketHub
Login
Description
Editorial
My Submission
1072.Permutations
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1072.Permutations
Time Limit:1000MS Memory Limit:65535KB
Description
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.
Input
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.
Output
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.
Sample test
Sample input
6 4 5237 2753 7523 5723 5327 2537 3 3 010 909 012
Sample output
2700 3
Note
Tags
brute force
combinatorics
implementation
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
6 4 5237 2753 7523 5723 5327 2537 3 3 010 909 012
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
