There is not a test which really test if the submitted function is really does really solve the problem. here the "best" solution is a trivial function, submitted many times in order to reach the condition.
Elmar, I readily admit that this is a very easy problem.That's why it is in the "Cody5:Easy" section. There is code that will guarantee a correct solution, regardless of when you submit your entry. However, people going for the lowest possible Cody score will just keep submitting a low score entry until they hit the clock just right. There's really not a whole heck of a lot I can do about that.
Is there a way I can override the clock command used in the test case. Maybe freeze the clock and ignore the one in assert?
What a waiting game
And what is the point of this problem if no coding is invloved and people just submit? The idea is very stupid and shameful.
Tip: the command pause in Cody has a ceil of 2 seconds currently. (The code could be way smaller without this constraint.)
This is funny, but probably shouldn't count for points ????
I tried dozens of times, it didn't work at all. Finally, I passed the test by submitting 3 seconds in advance.
The problem is solvable by coding (check my solution). Although a solution with no code is also possible...
Select every other element of a vector
Remove the two elements next to NaN value
Length of a short side
Converting binary to decimals
Verify Law of Large Numbers
Don't be mean. Be nice!
Make one vector from two others
Go to the head of the class!
I've got the power! (Inspired by Project Euler problem 29)
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office