Algorithm to calculate the number of combinations to form 100

Question

I am struck in a tricky situation where I need to calculate the number of combinations to form 100 based on different factors.

Those are

• Number of combin

Answer 1

I hope it's not a homework problem!

    def combinations(n: Int, step: Int, distance: Int, sum: Int = 100): List[List[Int]] =
      if (n == 1) 
        List(List(sum))
      else 
        for {
          first <- (step until sum by step).toList
          rest <- combinations(n - 1, step, distance, sum - first)
          if rest forall (x => (first - x).abs <= distance)
        } yield first :: rest