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]. > 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.
