If you have been in Cody long enough you have probably run across some badly constructed problems and test suites.

This problem represents a particularly difficult scenario. Yet, it is possible to solve it. Do you know how?

Description:

This is this problem's testsuite:

 %%
 y=myfunction();
 x=1/[]; % oops...
 assert(isequal(x,y));

As you may notice, the second line is not a proper division, so the testsuite will break at that point, and will return an error message:

??? Error using mrdivide Matrix dimensions must agree.

Typical hacks work by overloading some function in the evaluation code (e.g. assert hack). Perhaps it is possible to do the same here to avoid this error from happening?

Next problems in this series: Singularity 2.0 (harder); Singularity 2.0 (really hard)