Some instantly solvable in average search problems

The concept of instantly solvable in average search problem is introduced as that of a problem, which can be solved in the average time equal to the time of answer enumeration plus some constant which is independent of the problem dimension. Examples of instantly solvable in average search problems are given.