This document contains the solutions to 4 questions from the Zonal Informatics Olympiad in 2013. Question 1 asks for the minimum cost of making registers stable, with the answer being 18. Question 2 asks for the maximum contiguous segment value, with the answer being 65. Question 3 asks for the maximum price separation, with the answer being 30. Finally, question 4 asks for the number of ways to reorder tasks, with the answer being 120. It also provides the qualifying cutoffs of 55, 50, and 45 for standards 12, 11, and 10 or below, respectively.
This document contains the solutions to 4 questions from the Zonal Informatics Olympiad in 2013. Question 1 asks for the minimum cost of making registers stable, with the answer being 18. Question 2 asks for the maximum contiguous segment value, with the answer being 65. Question 3 asks for the maximum price separation, with the answer being 30. Finally, question 4 asks for the number of ways to reorder tasks, with the answer being 120. It also provides the qualifying cutoffs of 55, 50, and 45 for standards 12, 11, and 10 or below, respectively.
This document contains the solutions to 4 questions from the Zonal Informatics Olympiad in 2013. Question 1 asks for the minimum cost of making registers stable, with the answer being 18. Question 2 asks for the maximum contiguous segment value, with the answer being 65. Question 3 asks for the maximum price separation, with the answer being 30. Finally, question 4 asks for the number of ways to reorder tasks, with the answer being 120. It also provides the qualifying cutoffs of 55, 50, and 45 for standards 12, 11, and 10 or below, respectively.