SP28798 YAXS - Yet Another Xor Sequence

Fizz have an array A of n integers which ranges between \[1,5\] inclusive. Let f(i) denote number of times i occurs in the array. Fizz wants to maximize the value of max(f(1),f(2),f(3),f(4),f(5)). To achieve it, he can perform one operation in the array as many time as he likes. In each step Fizz can choose two integers Ai and Aj such that: - i!=j - 1 Case 1: 5 > >

N/A

N/A