Let f(x)= no. of ways of getting a sum x when pair of dice is thrown. S()=sum .
tot=S( f(i) ) 2<=i<=12 So the solution is : S( f(i)*(tot-f(i)) )/(6^4). Is daT fine.. ? -- 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.
