Eh. I can see what you're going for here, but I really think these heavily-restricted problems aren't very relevant for anything practical. If you're tasked with implementing a solution to a particular problem, such things as running time, memory consumption and numerical stability may well be on your mind, but not using anything from a long list of basic control structures and functions... not so much.
Solve other problems from the problem set, Basics - Fibonacci, and the answer will reveal itself to you (after a little reflection). I promise.
Could you please tell me how to use recursion without condition?
Nice!
Interesting problem!!
This ran on my computer but it can't be ran over here.
The test suite was testing for strict equality. A tolerance has been added, which now allows your solution to (rightly) pass.
this seems a bit silly
Just convert the result to uint32 xd
this is what I want
Very nice! At first the problem felt a bit heavy handed with all those restrictions (no "if", no "round"???) but I see now what you were going for and I like it :)
recursion of anonymous is from the blog of Loren.
the first test (checking 'for' loops, etc.) is not really doing anything...
Thank you , have fixed it.
The thing about these "don't use this don't use that" problems is that there are so many ways around such restrictions.
you are right,it inspires us to create a lot of new idea that is my purpose
Back to basics 8 - Matrix Diagonals
788 Solvers
417 Solvers
372 Solvers
256 Solvers
323 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!