I don't understand your restrictions. OK for Java functions, but here you need mod/rem no ?
No, mod() or rem() isn't necessary because you can recursively apply the method, down to a single-digit number. The small number of single-digit numbers (i.e., 10, assuming absolute value) then makes checking against known divisible numbers trivial.
I understand the java restriction, but the rest seem a bit heavy handed. Also the large number of similar problems might encourage solvers to build a general "divisible by n" routine instead
I'm not trying to be authoritarian; just providing awareness to interesting mathematical trivia. There are some numbers, such as 7 and 11, for which a range of methods are possible. Without blocking a lot of those basic functions, very easy workarounds can be used, defeating the purpose of trying to optimize your score (akin to regexp, eval, etc. being banned due to defeating the scoring system).
Also, building a general "divisible by n" routine is a good idea and I had thought about posting that at the end of the group of problems. I just think that it's too big for a standalone problem. There are many problems on Cody that are extremely simple and require no thought (like the recent string of beginner problems). There are also quite a few that require significant time, thought, and/or programming to solve, but they are all worth the same number of points. I prefer to break more difficult problems into simpler modules (just like is done in programming) to provide an encouraging approach, especially to those not already expert in Matlab. There are similarities between many of the problems in this set, but some numbers require quite different methods, such as 7 and 11.
Solved problems before reading comments and must agree with Alfonso. "divisible by N" approach worked nicely through all of them.
Thanks for the comment. I'll be adding a few more problems to this set in the near future to round out and finish up the "divisible by N" approach.
Why is the test suite not visible ? Is it me (firefox display issue) or it is supposed to be that way?
How am I only failing test 12?
I get tf=0 when i run this in Matlab...
That test case has the longest string input, by far. Your solution is coded to only sum digits twice. After those two steps, the resulting sum in this specific case is still greater than 9, and, therefore, fails your test of equal to a single-digit multiple of three (3, 6, or 9).
First time I see ismembertol.Nice !
Is this machine dependent?
I love the simplicity of this one!
Encode Roman Numerals
select the primes of a vector
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
Min of a Matrix
Rumis Scorer 2
Weighted Gold/Silver Standard
Divisible by n, prime divisors - 11, 13, 17, & 19
Scrabble Scores - 9
Find the treasures in MATLAB Central and discover how the community can help you!
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