As the competition is over I can reveal u the answer. There is only one number satisfying given condition and that is 578 so the answer is 20 :)
On Fri, Feb 25, 2011 at 10:33 PM, vaibhav shukla <[email protected]>wrote: > nothing to do with complexity... > just the ans > > > On Fri, Feb 25, 2011 at 10:23 PM, Rel Guzman Apaza <[email protected]>wrote: > >> 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. >> > > > > -- > 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. > -- Regards Gunjan Sharma Chairman IEEE Students Chapter IIT Roorkee B.Tech IV year CSE Contact No- +91 9997767077 -- 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.
