good work

F is good, I used inclusion exclusion on kth root to solve it With bit of precomputation, it got accept with 1ms runtime

@mihirmallick1698

17 күн бұрын

Yeah, mine got accepted with 1ms runtime too. Though I only considered counting numbers of the form a^p, where p is a prime, so this reduced the task to checking 2,3, 5, 7, 11, ... , 59th power of numbers and applying inclusion exclusion on that

I was able to solve ABCE . Any tips for solving problems with lower constraints? I am only able to solve O(n) and O(nlogn) ish solutions and just can't think when the constraints are lower

Won't there be (N+1) places where we can have 2 consecutive Dots.

@aryanc403

15 күн бұрын

Yes, we will have N+1 places.

i am so dumb for D still

is G that hard?

@aryanc403

17 күн бұрын

I felt it was hard, but editorial makes it look easy.