Codeforces round 697Div 3 problem G Strange Beauty
The time complexity of this solution is O(n*sqrt(n))*t, which is not optimized enough, but enough to pass the test cases.
Feel free to ask your doubts in the comment section.
The time complexity of this solution is O(n*sqrt(n))*t, which is not optimized enough, but enough to pass the test cases.
Feel free to ask your doubts in the comment section.