Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!
Solution Stats
Problem Comments
-
2 Comments
Hi David,
I avoided exceeding 'flintmax', minimized multiplication, division and conditional statements. For small n's, like in test 7, | only used a simple sieving algorithm. I also checked my solution with Elixir, and Java and I still get the same result for test 7.
I initially did a sieving algorithm, but it was not efficient enough for large n. I did not consider splitting with two different algorithms.
Solution Comments
Show commentsProblem Recent Solvers2
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
1643 Solvers
-
Back to basics 3 - Temp Directory
363 Solvers
-
Matrix which contains the values of an other matrix A at the given locations.
226 Solvers
-
Index of neighbor pixel with steepest gradient
23 Solvers
-
Basics: 'Find the eigenvalues of given matrix
406 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!