Add all the integers from 1 to n in which the digit m does not appear. m will always be a single digit integer from 0 to 9.
no_digit_sum(10,1) = 44
because 1 and 10 are excluded from the sum and
sum(2:9) = 44
simple but fun :)
answer to the first test case should be 205
and for third test case should be 558
as question given as summing all digits except the digit mention as 'm'
j'en ai chié
I wonder how could this kinda solution pass the test?!
I will improve this code !
wrong answer,need to use setdiff
Remove all the words that end with "ain"
Find the two most distant points
The Goldbach Conjecture
Filter AC, pass DC
Number of Circles in a Number
Find the peak 3n+1 sequence value
Who Has the Most Change?
Find the longest sequence of 1's in a binary sequence.
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