count of numbers between A and B (inclusive) that have sum of digits equal to S

Question

Task:
Find the count of numbers between A and B (inclusive) that have sum of digits equal to S. Also print the smallest such number between A and B (inclusive).

Input:
Single line consisting of A, B, and S.

Output:
Two lines.

In first line, the number of integers between A and B having sum of digits equal to S.

In second line, the smallest such number between A and B.

Constraints:

1 <= A <= B < 10^15

1 <= S <= 135

Answer 1

Python, 105

a,b,s=input()
l=filter(lambda n:sum(int(s)for s in list(str(n)))==s,range(a,b+1))
print l[0]
print len(l)

Answer 2

GolfScript, 35 bytes

~:S;),>{.10base{+}*S=!{;}*}%(\,)]n*

How it works

~         # Interpret the input string.
:S;       # Save the last integer in variable “S” and pop it from the stack.
),        # Increment it by 1 and create the array “[0 ... B]”
>         # Remove the first “A” elements. This leaves the array “[A ... B]”
{         # For each of those integers:
  .10base # Push its digits in base 10.
  {+}*    # Add the digits.
  S=!{;}* # If the sum is not equal to “S”, pop the integer from the stack.
}%        # Collect the results into an array.
(\        # Extract the first and swap it below the array.
,)        # Count the elements of the array of all remaining integers and increment by one. 
n\        # Separate the results by a newline.

Answer 3

Ruby, 109

Golfed:

a,b,s=gets.split(',').map(&:to_i);m=(a..b).select{|n|n.to_s.chars.map(&:to_i).reduce(:+)==s};puts m.size,m[0]

Ungolfed:

min, max, target_sum = gets.split(',').map(&:to_i)
matches = (min..max).select do |n|
  sum = n.to_s.chars.map(&:to_i).reduce(:+)
  sum == target_sum
end
puts matches.size
puts matches.first

Answer 4

GTB, 32

`A,B,Sn?A,B)→L1:SortA(L1~L1=S~L1