Is there a maximum time complexity? 2011/2/25 vaibhav shukla <[email protected]>
> Find the sum of digits of all the numbers whose digits are all in ascending > order from left to right. All these numbers lie between 500 to 1000 and > satisfy M divides (M-1)* !* + 1 , where M is any natural number. > (* " ! " * denotes factorial of the number) > -- > > > > best wishes!! > Vaibhav Shukla > DU-MCA > > -- > 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. > -- 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.
