Rosetta Code

Minimum multiple of m where digital sum equals m

Search small multiples until the digit sum matches the divisor.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/minimum_multiple_of_m_where_digital_sum_equals_m.vibe
def digit_sum(value: int) -> int
  total = 0
  current = value

  while current > 0
    total = total + (current % 10)
    current = current // 10
  end

  total
end

def minimum_multiple(m: int) -> int
  value = m

  while digit_sum(value) != m
    value = value + m
  end

  value
end

def run -> array<{ m: int, value: int }>
  [
    { m: 10, value: minimum_multiple(10) },
    { m: 12, value: minimum_multiple(12) },
    { m: 15, value: minimum_multiple(15) }
  ]
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.