The solution ought to be valid for all p-combinations from n
Thanks Virxen for your help. But your program is static. I want to apply it on all 3-combinations from 1 to n
This is the code: //-------------------------------------- // Systematically generate combinations. //--------------------------------------...
hi! I would like to generate all combination k choose n such that evry combination have less than 2 sane numbers each other. " I already use...
Separate names with a comma.