Hi,
I am Aman Ratan, a mechanical engineer and i am currently involved in beam calculation for more than 5 supports.
Its an uncharted territory so to speak.
The problem statement is as follows ---
I want to distribute 'N' number of units (each with value 10) into '4' groups and then obtain the sum of those groups individually in the form of a list (All Possible combinations and not permutations).
Its easier if i explain it with an example,
Suppose the number is 1000
dividing it into 100 parts, we get 100 units each with value 10.
now lets consider combinations in which these 100 units can be distributed into as 4 sets.
i.e. 97 - 1 - 1 - 1
next can be 96 - 2 - 1 - 1
then 95 - 3 - 1 - 1
and so on till 1 - 1 - 1 - 97
The aim is to develop a program that can list all the possible combinations like above (not permutations)
Sorry for the inability to convey the problem statement properly.
Any help will be appreciated.
*Admins, not sure if i have posted the problem in the appropriate thread. If not please make neccessary changes at your discretion.
Bookmarks