Codeforces Round 822 (Div. 2) |
---|
Finished |
You are given $$$n$$$ sticks with positive integral length $$$a_1, a_2, \ldots, a_n$$$.
You can perform the following operation any number of times (possibly zero):
What is the minimum number of operations that you have to perform such that it is possible to select three of the $$$n$$$ sticks and use them without breaking to form an equilateral triangle?
An equilateral triangle is a triangle where all of its three sides have the same length.
The first line of the input contains a single integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of test cases. The description of the test cases follows.
The first line of each test case contains a single integer $$$n$$$ ($$$3 \le n \le 300$$$) — the number of sticks.
The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the lengths of the sticks.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$300$$$.
For each test case, print one integer on a single line — the minimum number of operations to be made.
431 2 347 3 7 353 4 2 1 183 1 4 1 5 9 2 6
2 4 1 1
In the first test case, you can increase the length of the first stick by $$$1$$$, then decrease the length of the third stick by $$$1$$$. In total, you perform $$$2$$$ operations, such that the three sticks form an equilateral triangle of side length $$$2$$$.
In the fourth test case, you can decrease the length of the seventh stick by $$$1$$$. An equilateral triangle of side length $$$1$$$ can be selected and formed by the second, fourth, and seventh sticks.
Name |
---|