Project translated automatically. Log in or register, to view the original The first line contains one whole number n (1 ≤ n ≤ 50) - the number of massive elements.The second line contains n whole numbers a1, a2,...,an (1 ≤ ai ≤ 100).Output data Remove the sorted massive in order of loss.In Chapulandia on the straight Ox there are three houses.The first is at x1, the second is at x2, and the third is at x3.The municipality plans to set a new 5G height, for which it needs to choose a certain optimal point.What is the minimum total distance from residential houses to the new 5G height?It is guaranteed that the right answer is always a whole number.When solving the task, describe your method of sorting with inserts.Do not use built-in sorting methods.The first line follows three different whole numbers x1, x2 and x3 (1 ≤ x1, x2, x3 ≤ 100) - the coordinates of the first, second and third houses.The only total number is the minimum total distance from residential houses to the new 5G height.Asmund has today his birthday.In honor of this, he decided to blur himself and bought a pack of M&M sweets.Asmund put n candy on the table.The desserts are numbered from 1 to n to the left.All desserts have a different sweetness.Asmund knows the sweetness of the dessert in advance and conditionally indicates it by the number - the sweeter the dessert, the more the number.So the dessert with the number I has a sweetness.Asmund wants to divide the desserts into two pets to share with his sister.Each dog should have at least one dessert, and each dessert should be just in one dog.Asmund, as a good and honest brother, wants to divide the desserts so that the sweetest dessert from the first cup is as little as possible different from the sweetest from the second.Formally, Asmund wants to divide the desserts into two cups of A and B so that the value of the "max" (A) - min (B) - was as small as possible, where max (A) - the sweetest dessert from the first cup, and min (B) - the sweetest dessert from the second.For example, if n = 5, and the sweetness of the confett is equal to s = [3, 1, 2, 6, 4], then one of the possible divisions has the kind: the first bowl: A = [1, 2, 4] the second bowl: B = [3, 6] In this case the value of the bowlmax(A) - min(B) bowl will be equal to bowl4 - 3 bowl = 1.This example illustrates one of the ways of optimum breakdown.Determine the minimum value of max(A) - min(B) When solving a task, describe your method of sorting by a bubble.Do not use built-in sorting methods.In the first line the total number t (1 < t < 1000) is recorded - the number of sets of test data in the test.The t sets of test data are recorded.Each set consists of two lines.The first line contains the whole positive number n (2 < n < 50) - the number of sweets.The following line contains n positive whole numbers s1, s2, s3 ... sn (1 < si < 1000), where si is the sweetness of the i-oy.Please note that among the elements of the mass s may be equal values.For each set of test data, extract one whole number - the minimum value of the value max(A) - min(B) , with the optimal breakdown of all sweets on a hole.Ayat and Ayat play the game.Initially on the asphalt is written n of whole numbers a1, a2, a3 ... Every move one of the boys chooses one number and washes it.The game continues until one number remains on the asphalt.The players are walking in a row, the game begins with Aibat.Ibat wants to minimize the remaining number, Irat wants to maximize.Find out which number will remain the last, provided that both boys play the best.When solving a task, describe your sorting method by choice.Do not use built-in sorting methods.In the first line the whole number is given n (1).

Proposals 5

Oleg Kravchenko

Winning proposal

8 1

Projects 8
Rating -
Rating 164

Budget: 1650 RUB Deadline: 1 day

Good day ! I look at the tasks, there are ideas to solve. I will do everything in time, with comments in the code, if necessary.

Mykhailo K.

23 1

Projects 23
Rating -
Rating 1 100

Budget: 2000 RUB Deadline: 1 day

Hello, I read the tasks. I’ve already made a plan of a robot and how to do it. Ready to start immediately. There is a great experience of robots with such tasks. I will be happy to cooperate)

The list does not show proposals concealed by the client or freelancer with a Plus profile, as well as proposals violating rules

Ybrbnf Gjkeir
Russia

Projects 2
Rating -
Rating 77

Task of Python

Client's review of cooperation with Oleg Kravchenko

Task of Python

4.9

Freelancer's review of cooperation with client

Task of Python

5.0

Oleg Kravchenko

Oleg Kravchenko

Mykhailo K.

Proposals are currently absent

Current freelance projects in the category Python

Sale purchase of targeted traffic Push notifications, in-page push, on-click (pop-up), banner. Payment models.

Signal bot for trading

Website parsing, bypassing Akamai protection

Development of an AI bot for receiving and processing orders from restaurants in Telegram with integration into 1C.

Need to fix a bug in the current version of the bot.