Second thought: I believe this algorithm is not bullet-proof. what if a = [4,6,12,18]?
I am passing all test suit case in MATLAB 207b but I am getting this message:
While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then submit.
Based on Gangyi's solution (Solution 57169). (And with thanks to Alfonso for directing my attention towards it. :-)
Flawed solution; it fails when (for example) a = [2 10 20 30] .
This solution just confirms my belief that the code size measure needs to count code executed within a regexp.
This Solution is a little difficult to obtain,but seems like an approach.
This iterationg is good indeed.
good trick
Yes, the size matters for this scoring, but using m(a)=0 makes for a grossly large vector. I'm not a big fan of this type of solution, which seems to make up the shortest solutions.
If you do not care about Cody-'size' solution 66088 implements the same algorithm more efficiently (using sparse vectors instead of a 'grossly large' matrix)...
my personal favourite nevertheless is Gangyi's 57169 solution, which seems to run typically twice as fast a my version...
Remove the small words from a list of words.
624 Solvers
Project Euler: Problem 3, Largest prime factor
301 Solvers
First non-zero element in each column
556 Solvers
Create a vector whose elements depend on the previous element
359 Solvers
533 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!