if we have to find out no of possible outputs ...........then we can do this
for(i=1;i<=n;i++)
{
ans=ans * no of 1s in ith row
return(ans);
}
On Thu, Jul 14, 2011 at 11:46 PM, SkRiPt KiDdIe <[email protected]>wrote:> > > Will a Back-tracking solution suffice..?? > > -- > 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. > -- shilpa gupta b tech 2nd year computer science and engineering mnnit allahabad -- 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.
