The tasks

Java — incorrectly specified categories?

7 USD

Client's review of cooperation with Yevgeny Kreyz

The tasks

7 USD

Good work.It succeeded even earlier than I planned.

4.9

Profile deleted

17 June 2018

Project translated automatically. Log in or register, to view the original The option 14.1 .For a random number from 0 to 9, draw its value to the console by a prefix.For example, for the number 9 on the console must be printed the line "Nine".2ndCreate an application that will perform the translation of numbers from a decimal system of counting to a binary and a sixteen system of counting (drawing the block scheme of the algorithm).ThreeCreate a program that calculates the Fibonacci numbers.Fibonacci numbers are a sequence of numbers in which each following number is equal to the sum of the two previous numbers.The size is 20 numbers.The beginning of the sequence: 1, 2 ... 4.A line of symbols among which there is a double (:).Determine how many symbols are preceded.and 5.The whole numbers are a1, a2, ..., an and b1, b2, ..., bn.Convert the sequence of bl, b2, ..., bn according to the rule: if ai ≤ 0, then bi increase by 10 times, otherwise bi replaced by zero (i = 1, 2, ..., n).6 .The data of the actual numbers a1, a2, ..., an.All members of the sequence of a1, a2, ..., an shall be multiplied by the square of its smallest member if ak ≥ 0, and by the square of its greatest member if ak ≤ 0 (1 ≤ k ≤ n).7 .Data of the coordinates of n points on the flat: (X1, Y2), ..., (Hn, Yn) (n ≤ 30).Find the number of pairs of points, the distance between which is the largest (rule that such gift is the only) (draw the block scheme of the algorithm).8 .The consistency of a1, a2, ..., and an consists of zero and units.Put at the beginning of this sequence of zero, and then the units.The 9.Sorting by choice.The sequence of numbers is a1, a2, ..., and n.It is necessary to move the elements in such a way that they are placed on the loss.For this, in the mass, starting with the first, the largest element is selected and placed on the first place, and the first - on the place of the largest.Then, starting with the second, this procedure is repeated.Write the sorting algorithm by choice.The 10.Form a square matrix of order n according to the given sample:

Proposals 2 Rejected 1 Discussions 1