You are correct, this question is by no means testing anything non trivial/hard. It is one of the problems that the beginners in competitive programming solve. As for the discussion regarding this problem in current thread, some enthusiastic guy had got this AC in 0.08 at SPOJ, and everyone was trying to see how to implement the program efficiently to get it down to 0.00 Seconds.
Thanks, Rizwan. On Mon, Jun 27, 2011 at 12:29 AM, Dan <dant...@aol.com> wrote: > I found the problem statement on the web page link to be a bit > "weak". Nothing in the problem statement says that you must do > anything other than read in two lines of integers and multiply them in > pairs and sum the results ( ie. Dot Product ). > > People seem to think that you should sort the data first ( an > assumption that is NOT in the problem statement ). Does that mean > that you get the problem wrong if you don't sort the data first? > > Also... it looks as if you have to write the code in one of the > listed languages. Is that true? > You then submit your "text" code and it is compiled somewhere else? > What compiler(s) is/are used and with what settings? This can affect > both speed and memory (by large amounts). > Also... exactly what does 1.6M for memory mean? > > For the moment, let's assume that you ARE supposed to sort the data > first. > Then... at best, all this test really does is check to see if you > can read and sort data quickly. Multiplying pairs of numbers is > trivial and I doubt many individuals are writing much code to speed up > this simple Dot Product calculation. So... unless you write your > own integer sorting algorithm that you are very proud of, what's the > point of this test (other than it might be worthwhile as a homework > assignment to new coders). > > Have I missed something? > > Dan :-) > > > On Jun 24, 9:53 am, prathimzn <prathi...@gmail.com> wrote: >> http://www.spoj.pl/problems/FASHION/ >> >> i summit this question and my time is 0.02 as i used sorting and then >> multiply corresponding index value and sum them to get ans. >> >> but best time is 0.00 and 1.6M in C. >> can anyone tell me what is the best algo to solve this problem in 0.00 i.e. >> best algo >> >> * >> >> - - - - - >> WITH REGARDS, >> PRAMENDRA RATHI >> * >> ** >> *B.TECH 2ND YEAR* >> *COMPUTER SCIENCE AND ENGINEERING* >> *NIT ALLAHABAD* > > -- > 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. > > -- Thanks and regards Rizwan A Hudda http://sites.google.com/site/rizwanhudda2 -- 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.
