MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply Today**New to MATLAB?**

Search Solutions

What is Size?

Size refers to the number of nodes in a parse tree. Generally speaking, you can think of size as code length.

25Size

0 Comments

0Size

0 Comments

24Size

0 Comments

24Size

0 Comments

24Size

0 Comments

35Size

0 Comments

148Size

0 Comments

166Size

0 Comments

174Size

0 Comments

216Size

0 Comments

43Size

0 Comments

Incorrect

0 Comments

33Size

0 Comments

Incorrect

0 Comments

Incorrect

0 Comments

Incorrect

0 Comments

26Size

0 Comments

27Size

0 Comments

1 player likes this solution

27Size

0 Comments

37Size

0 Comments

Incorrect

0 Comments

Incorrect

0 Comments

178Size

0 Comments

Incorrect

0 Comments

24Size

0 Comments

32Size

0 Comments

87Size

0 Comments

100Size

0 Comments

110Size

0 Comments

Incorrect

0 Comments

106Size

0 Comments

113Size

0 Comments

117Size

0 Comments

Incorrect

0 Comments

41Size

0 Comments

24Size

0 Comments

31Size

0 Comments

45Size

0 Comments

174Size

0 Comments

34Size

0 Comments

Incorrect

3 Comments

3 Comments

J-G van der Toorn
on 24 Sep 2012

Interesting. I didn't know about 'anonymous functions' until Cody came to existence. It has already paid off.
Therefore, unfortunately, I could not implement an 'anonymous function' trap in this Problem. The next one will contain one.
I am curious about the next mtree-score-hack.

Aurelien Queffurust
on 9 Nov 2012

As usual, I am still impressed by your solution!

Khaled Hamed
on 10 Nov 2012

I do agree that 'str2func' may be used to wrap a long solution into a much shorter size. Using an anonymous function does not reduce size, however, and should nt be trapped. Same thing goes with 'regexp', which can be used to pass a multiline calculation as one command.

37Size

0 Comments

Incorrect

0 Comments

24Size

0 Comments

135Size

0 Comments

43Size

0 Comments

43Size

0 Comments

43Size

0 Comments

Incorrect

0 Comments