DEV Community

loading...

Discussion on: Daily Challenge #269 - Decompose n!

Collapse
pgronkievitz profile image
Patryk Gronkiewicz

You can check for divisors in [2;ceiling(sqrt(n))], that should be way faster for large n