Problem 1769. singularity 2.0 (easier)
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)
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers17
Suggested Problems
-
Find the numeric mean of the prime numbers in a matrix.
9127 Solvers
-
2599 Solvers
-
How long is the longest prime diagonal?
409 Solvers
-
314 Solvers
-
Magic is simple (for beginners)
11105 Solvers
More from this Author33
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!