HI, Is there a method to calculate something like 23!/(7!*10!) i.e. permutations with repeated elements in such a way that we need not calculate all the factorials involved? The problem in calculating all the factorials is in storing them. As 23! will make even long long in C++ to overflow, but the required answer won't.
Thanks -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
