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
Problem Recent Solvers2
Suggested Problems
-
Convert Roman to Arabic Numerals
84 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
168 Solvers
-
Permute diagonal and antidiagonal
275 Solvers
-
Split a string into chunks of specified length
932 Solvers
-
Create a Multiplication table matrix...
342 Solvers
More from this Author66
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!