Pattern Recognition and Related Topics of Olympiad Tasks
Pavel S. Pankov, Azret A. KENZHALIEV · OLYMPIADS IN INFORMATICS · 2020
In most of tasks proposed for olympiads in informatics inital data are taken arbitrary from any ranges such that a “brute force” solution (close to immediate translation of condition of the task into an algorithmical one) can pass tests with initial data from narrow ranges, and the task itself is to improve that solution. We make a survey of types of tasks where inital data are too vast to use a “brute force” but they are announced to be connected and the task itself is to extract necessary information in an optimal way. We consider tasks on recognition and on restoration of data from a unified point of view. We also make an attempt to describe various types of tasks formally.