Subset question (math)
OK, to be brutally honest I dont know squat about programming but I do need some help from someone who does.
I need a list generated (or a use-able script) of all possible subset combinations for the set 1,2,3,4,5,6,7,8,9,10,12. Select six. Numbers cannot repeat.
Example subset: 1,2,3,4,5,6 (six selected, no repeats).
Example of what I dont need: 1,1,2,2,3,3,4,4,5,5,12,12 or 1,1,1,1,1,6.
I will also need the opposites removed, meaning...if I have 1,3,5,7,9,11 then I need 2,4,6,8,10,12 eliminated from the final list.
This is for a game, where you must select all numbers right or no numbers right. In case anyone is wondering.
Thanks in advance.
Users Browsing this Thread
There are currently 1 users browsing this thread. (0 members and 1 guests)