sourabh singh, i think problem in your code may arise due to term (m/a -n/a) ,instead it should be m/a -(n-1)/a . there may be some other problem also .but this can be one of them
On Mon, Jun 25, 2012 at 5:10 PM, <algogeeks@googlegroups.com> wrote: > Today's Topic Summary > > Group: http://groups.google.com/group/algogeeks/topics > > Is max distance between two leaves(diameter) in a tree is equal to max > distance between any two node in that tree?? [1 Update] > Adobe interview question [1 Update] > 4Sum [1 Update] > spoj problem EASYMATH [3 Updates] > Find the Max from each sub-array of size k [1 Update] > Lucky Draw - longest increasing sub sequence in a circular arrangement [1 > Update] > Reverse Queue [1 Update] > Find peak element in log(n) [1 Update] > > Is max distance between two leaves(diameter) in a tree is equal to max > distance between any two node in that tree?? > > atul anand <atul.87fri...@gmail.com> Jun 25 12:48PM +0530 > > consider a case where tree is right skewed or left skewed , in dat case max > distance b/w two node found are root and leftmost or rightmost node(left > or right skewed) . so its not alwayzz true > > ...more > > Adobe interview question > > himanshu kansal <himanshukansal...@gmail.com> Jun 25 09:12AM +0530 > > @rahul: the ques itself says that we have to implement abstract > class*without > * using pure virtual function... > > > -- > > Regards > Himanshu Kansal > Msc Comp. sc. > (University of Delhi) > ...more > > 4Sum > > shady <sinv...@gmail.com> Jun 25 12:42AM +0530 > > @hemesh, amol = correct solutions > > ABCDEF another problem on SPOJ, incase people want to try. > > ...more > > spoj problem EASYMATH > > Sourabh Singh <singhsourab...@gmail.com> Jun 24 07:40AM -0700 > > please suggest something : > > Problem : > http://www.spoj.pl/problems/EASYMATH/ > > C++ code : > http://ideone.com/r2OSb > was getting wrong ans due to over flow i think in LCM() for big prime's i > guess. ...more > > Hassan Monfared <hmonfa...@gmail.com> Jun 24 07:29PM +0430 > > use " return (a/gcd(a,b)*b instead " > > ...more > > shady <sinv...@gmail.com> Jun 25 12:35AM +0530 > > dont post codes, ask whether your algorithm is correct or not. > > ...more > > Find the Max from each sub-array of size k > > rajesh pandey <rajesh.pandey.i...@gmail.com> Jun 24 05:10PM +0530 > > can find one more solution in my blog.... > http://pandey123.wordpress.com/ > > check it... and tell me if you have any doubt... > > ...more > > Lucky Draw - longest increasing sub sequence in a circular arrangement > > sachin goyal <sachingoyal....@gmail.com> Jun 24 05:42AM -0700 > > http://www.codechef.com/problems/D2/ > > Please suggest some good algorithm for this problem > ...more > > Reverse Queue > > deepikaanand <swinyanand...@gmail.com> Jun 24 08:53AM -0700 > > code:- > http://ideone.com/yMQSK > ...more > > Find peak element in log(n) > > Anshul Agarwal <anshul.agarwa...@gmail.com> Jun 24 07:11PM +0530 > > can any one expain for 2-D?? > > > ...more > > You received this message because you are subscribed to the Google Group > algogeeks. > You can post via email. > To unsubscribe from this group, send an empty message. > For more options, visit this group. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
