Find out which combinations of numbers in a set add up to a given total

by

This special case of the Knapsack problem is called Subset Sum.

More Related Contents:

  1. Custom Weighted Scale [closed]
  2. Sum a number with divisors to get another number
  3. How to create the most compact mapping n → isprime(n) up to a limit N?
  4. Mapping two integers to one, in a unique and deterministic way
  5. Least common multiple for 3 or more numbers
  6. Select k random elements from a list whose elements have weights
  7. Is it possible to express “t” variable from Cubic Bezier Curve equation?
  8. Choosing n numbers with fixed sum
  9. Fast way to calculate n! mod m where m is prime?
  10. Need help in mod 1000000007 questions
  11. Check if one integer is an integer power of another
  12. Modulus power of big numbers
  13. Puzzle: Find largest rectangle (maximal rectangle problem)
  14. How can I calculate the age of a person in year, month, days?
  15. 3D Least Squares Plane
  16. Shortest distance between points algorithm
  17. The Sieve of Atkin
  18. finding a^b^c^… mod m
  19. Determining if two line segments intersect? [duplicate]
  20. Fastest algorithm for circle shift N sized array for M position
  21. Test if a number is fibonacci
  22. How do you find a point at a given perpendicular distance from a line?
  23. How to find distance from the latitude and longitude of two locations?
  24. Reverse complex 2D lookup table
  25. How do I determine whether my calculation of pi is accurate?
  26. JavaScript: Calculate the nth root of a number
  27. what is the fastest way to find the gcd of n numbers?
  28. Calculating phi(k) for 1
  29. Optimized low-accuracy approximation to `rootn(x, n)`
  30. How can I perform Collision Detection on rotated rectangles? [closed]

Leave a Comment