I don't think you quite understood what I meant. You said: "So to make such generator I should know the P.d.F they used as if for example all the cases are the worst case in the input file then may be simple algorithm take long time but if the cases behave with a certain P.d.F then simple algorithm may succeed."
The test cases are deliberately designed so that this is never the case. A simple algorithm which performs badly on the worst possible input will not be good enough to solve the problem. On May 21, 9:26 pm, Abdelrhman Abotaleb <[email protected]> wrote: > @TripleM > No;My question is not to test my source code over the possible different > conditions. > [In this case I suggest as you say the boundary conditions for the problem > and a general case] > But I want to make the input files generator. > > i.e. generating a long input file in my PC to make sure that my code will > behave efficiently and in the > specified time and without any memory bugs. > > So to make such generator I should know the P.d.F they used > as if for example all the cases are the worst case in the input file then > may be simple algorithm take long time > but if the cases behave with a certain P.d.F then simple algorithm may > succeed. > > Thanks a lot > > > > On Fri, May 21, 2010 at 10:50 AM, TripleM <[email protected]> wrote: > > Your code should always be able to work in the worst possible case. > > Namely, take the input that your code takes the longest to solve, and > > repeat that 10,000 times. > > > On May 21, 7:00 pm, Abdelrhman Abotaleb <[email protected]> > > wrote: > > > I'm wondering about the probability density function used to generate > > > numbers in the input files > > > for example in the snappers chain [Codejam Qualification stage 2010] > > number > > > of test cases T > > > > 1 ≤ *T* ≤ 10,000. > > > > So What's the P.d.f of T !? > > > > and if you don't know ; what's the best P.d.f to simulate the input > > file!? > > > > Uniform ,Bernoulli ,Gaussian !? oe what? > > > > Thanks > > > > -- > > > Regards, > > > Abdelrhman.M. Abotaleb > > > > IEEE 2010 Student Chapter, > > > AC Active member > > > SPE 2009 Well Services Moderator > > > cairo.spe.org > > > > Major: Electronics & Communications > > > Minor: Computer Engineering > > > > -- > > > You received this message because you are subscribed to the Google Groups > > "google-codejam" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > [email protected]<google-code%[email protected]> > > . > > > For more options, visit this group athttp:// > > groups.google.com/group/google-code?hl=en. > > > -- > > You received this message because you are subscribed to the Google Groups > > "google-codejam" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]<google-code%[email protected]> > > . > > For more options, visit this group at > >http://groups.google.com/group/google-code?hl=en. > > -- > Regards, > Abdelrhman.M. Abotaleb > > IEEE 2010 Student Chapter, > AC Active member > SPE 2009 Well Services Moderator > cairo.spe.org > > Major: Electronics & Communications > Minor: Computer Engineering > > -- > You received this message because you are subscribed to the Google Groups > "google-codejam" 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 > athttp://groups.google.com/group/google-code?hl=en. -- You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en.
