@ALL is there any tutorial on FFT in C/C++ ?
On Mon, Dec 19, 2011 at 5:27 PM, SAMMM <somnath.nit...@gmail.com> wrote: > @Atul--- > > > Read the Comment carefully . > I told :- > > "For finding the triplet we need to have a equation of the form : > f(x) ^3 + af(x)^2 + b f(x) . need to to find the cofficient of a > and b where f(x) is the polynomial formed from the elements in the > given set. This method will suffice the time limit with n<= 40000 " > > -- > 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.
