Re: counting how many positive integers <n have digits that add up to m

From: "Daniel T." <daniel_t@xxxxxxxxxxxxx>
Date: Sat, 22 May 2010 08:47:35 -0400

superpollo <utente@xxxxxxxxxxx> wrote:

in python:

def prttn(m, n):
tot = 0
for i in range(n):
s = str(i)
sum = 0
for j in range(len(s)):
sum += int(s[j])
if sum == m:
tot += 1
return tot

any suggestion for improvement?

My first thought is that there might be a formula that will return the
result with no loops.
.

Follow-Ups:
- Re: counting how many positive integers <n have digits that add up to m
  - From: S Perryman

References:
- counting how many positive integers <n have digits that add up to m
  - From: superpollo

Prev by Date: Re: on goto
Next by Date: complexity again. (was: on goto)
Previous by thread: Re: counting how many positive integers <n have digits that add up to m
Next by thread: Re: counting how many positive integers <n have digits that add up to m
Index(es):
- Date
- Thread

Relevant Pages

Re: counting how many positive integers
... def prttn: ... if sum == m: ... tot += 1 ... why does the distribution formula works? ...
(comp.programming)
Re: counting how many positive integers
... def prttn: ... if sum == m: ... tot += 1 ... why does the distribution formula works? ...
(comp.programming)
Re: function that counts...
... in order to create a list of digits for a number? ... Now that you have the sequences it's easy to count which sums up to m. ... if sum == m: ... tot += 1 ...
(comp.lang.python)
RE: Sum of 15 random +/- integers always greater than or equal to
... just generate the numbers until they sum to a positive value. ... Sub ABCD() ... Dim bd As Long ... Dim tot As Long ...
(microsoft.public.excel.programming)
Re: counting how many positive integers
... if sum == m: ... tot += 1 ... the calculations we did includes cases where the "digits" can be greater ... Inclusion-Exclusion (read on this later, ...
(comp.programming)