Problem 1190. Golomb's self-describing sequence (based on Euler 341)

Solution 188623

Submitted on 9 Jan 2013 by Alfonso Nieto-Castanon

Size: 37
Leading solution size is 11.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

3 Comments

3 Comments

Richard Zapor on 10 Jan 2013

I prefer g(end+1:end+g(gptr))=gptr; to usage of repmat. My machine to solve 1234567 takes 48msec vs 15.4 sec using repmat. repmat has a performance issue with large column replication. Unfortunately score is code size and not time.

Alfonso Nieto-Castanon on 10 Jan 2013

totally agree (not to mention the entire 'growing inside a loop' uglyness), cody style is very far from any reasonable coding standard...

James on 10 Jan 2013

That's very interesting. The time difference on my (presumably much older) version of MATLAB is much less. Your method gives me an average time of about 18.8 sec, while repmat gives me an average time of 19.5 sec.

Test Suite

Test	Status	Code Input and Output
1	Pass	%% assert(isequal(euler341(1),1))
2	Pass	%% assert(isequal(euler341(10),5))
3	Pass	%% assert(isequal(euler341(310),42))
4	Pass	%% assert(isequal(euler341(4242),210))
5	Pass	%% assert(isequal(euler341(328509),3084))
6	Pass	%% assert(isequal(euler341(551368),4247))
7	Pass	%% assert(isequal(euler341(614125),4540))

Problem 1190. Golomb's self-describing sequence (based on Euler 341)

Test Suite

Suggested Problems

More from this Author80

Problem 1190. Golomb's self-describing sequence (based on Euler 341)

Test Suite

Suggested Problems

More from this Author80

Players