Project Euler 20

Summary

In this video, I will be coding the solution for the problem # Adding up all the digits in 100! (factorial, not yelling the number). Videos going forward should be in 1440p 60fps if all goes right. I use the Big Integer class from the last two videos to solve Factorial Digit Sum. Please ! Leave comments and questions in the section below. I mean BigInt just melts this one. It's perhaps against the spirit of Want my help with your code? the options here: bio.site/problemsolvingwizard Please watch: "CSES problem Increasing Array" youtube.com/watch?v=FiHSPt_cBV0 -~-~~-~~~-~~-~- Pretty easy/short one, just brute forcing numbers under 1 million by even/odd until they reach 1, and counting the number of terms ... n! means n x (n-1) x ... x 3 x 2 x 1. For example, 10! = 10 x 9 x ... x 3 x 2 x 1 = 3628800, and the sum of the digits in the number 10! In this one we are basically just combining a few basic concepts we have already covered previously so this one is really quick. We're solving some algorithmics problems from In this video I tackle a problem about cyclic sets of figurate numbers. Have you ever heard of a heptagonal number?