We have these questions we call 'mediumship testers'. They give you no question, and you must output the correct answer, whatever it is. These, definitelly are the hardest ones.
Kidding :) IMHO, the hardest questions are the geometric ones. Computational Geometry<http://en.wikipedia.org/wiki/Computational_geometry>requires and extra dose of abstraction, most of the time. On Wed, Aug 12, 2009 at 12:01 AM, Hawston LLH <[email protected]> wrote: > what is the hardest type of question in code jam? > > > On Tue, Aug 11, 2009 at 9:20 PM, Ahmed Medhat <[email protected]>wrote: > >> simply how can you calculate the number of prime numbers between 1 and 100 >> and the prime numbers between 1 and 1000000 make a code and see the >> deference in time :) >> >> 2009/8/11 Akhil <[email protected]> >> >>> >>> What do you mean by Brute Force ? >>> >>> When some algorithm works for a smaller values of a particular >>> problem, why should it not work with larger values ? >>> >>> -- >>> Regards... >>> Akhil ! >>> >>> >> >> >> -- >> Kind Regards, >> >> Ahmed Medhat >> Software Engineer >> National Technology Group - Egypt Development Center (EDC) >> Tel.: 202 24052355/6 - Ext.:2005 >> E-mail:[email protected] <e-mail%[email protected]> >> >> >> > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
