Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!
75.0% Correct | 25.0% Incorrect
Last Solution submitted on Feb 12, 2022
Ramon Villamangca on 27 Jan 2022
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.
David Hill on 27 Jan 2022
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 CommentsShow comments
Problem Recent Solvers2
Project Euler: Problem 1, Multiples of 3 and 5
Wind outward from the center ...
Matrix indexing with two vectors of indices
Test if two numbers have the same digits
More from this Author116
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!