Viewing insights from Codeforces 1834B: Maximum Strength that are similar (thus shared) with only this insight from Codeforces 1859C: Another Permutation Problem: It was surprisingly easy problem because of the the small range of the variable n (n <= 250) and that allowed a brute force approach that I've considered, but still looking for a more efficient solution even though O(n^2) or O(n^3) are super efficient. Keep in mind that not every problem has tricks by alextm