Обсуждение @ 1082. Иванушка-дурачок @ Timus Online Judge

Maigo Akisame The solution is just printing 1,2,...,n, but how did you think it out? [6] // Задача 1082. Иванушка-дурачок 10 июн 2004 18:13

Yosif Yosifov Re: The solution is just printing 1,2,...,n, but how did you think it out? [4] // Задача 1082. Иванушка-дурачок 10 июн 2004 22:57

Because the procedure P is sorting .

Fokysnik Re: The solution is just printing 1,2,...,n, but how did you think it out? [3] // Задача 1082. Иванушка-дурачок 31 июл 2006 13:44

The tsar's program is quicksort algorithm
it sorts input array and counts in how many swaps it was done (variable c)(not exact value but represents it)...
Just try to think about variable c and you will realize that.
So the solution is to print not only 1,2,...,n but
ANY SORTED ARRAY OF LENGTH N

AlainDelon Re: The solution is just printing 1,2,...,n, but how did you think it out? [1] // Задача 1082. Иванушка-дурачок 23 дек 2007 18:31

I resolve it by recursively fill the whole array.

And I think out sorted array because I think it is easier to make the array sorted(since then the quicksort become bubble sort).

Samer Abdulamer Re: The solution is just printing 1,2,...,n, but how did you think it out? // Задача 1082. Иванушка-дурачок 13 апр 2022 12:29

Обсуждение задачи 1082. Иванушка-дурачок