Comments
0

The number of prime factors will always be less than √n, So TC = O(√n)
+33

2023 should not be a permutation
On n0sk1ll → Editorial for Hello 2023, 4 years ago
+11

submitted editorial in 0ms
+6

Woah, didn't know that, that's some crazy amount of time difference man. The vector solution is taking around 8000ms whereas pair one is running at around 250ms
+3

What does that performance specify btw?

My Card
On b8LI → Where is my rating?, 4 years ago
+3

Was there any recalculation?
+3

Pass the reference for visted and curr vectors and make the necessary changes in update() and DFS() functions.

This is ACCEPTED submission of your code.

1st Change
2nd Change

Hope you got it right :)
On Bakry → Red Isn't Impossible, 4 years ago
0

Congratulations, well deserved!

This is really a very good post about the whole journey. Thanks for posting this, I've been stuck in the 1500-1600 range for a long time, about the loose hope, but Now I think I can still do it.

Once again thanks for posting this. It means a lot to many people.
0

I also used to be like this. Editorials were too much complicated to understand. I asked some of my friends and got some advice.

Whenever you practice problems, even if you solve the problem try to look at the editorials of those problems too. It is useful because

  1. You already know the possible way to solve it. So even if the editorial is slightly different you'll understand

  2. Sometimes the method we solve the problems are may not be optimal, in editorials you can even get better methods.

  3. And in the comment section there are so many people like us, who share their idea, so you might also understand from that.