Question on number theory.

I solved 250 Thousand Tons of TNT and I took a look at the solution to see if there was a better way to do it.

I am confused about the first proposal: "Since $$$k$$$ is a divisor of $$$n$$$, there are $$$\mathcal{O}(\sqrt[3]{n})$$$ such $$$k$$$."

I know that you can find the number of divisors of an integer $$$n$$$ in $$$\mathcal{O}(\sqrt[3]{n})$$$ but I don't think that's an upper bound for the amount of divisors itself.

Am I missing something? Have I misunderstood the explanation?

Looking for learning mates.

Hi everyone, I started solving problems here on codeforces a month ago. I would like to join a team or a group of study but I don't know where to find one, any suggestions?

If you would like to solve problems and discuss them together send me a friend request!

Thank you for your consideration :)