what is the hardest type of question in code jam? On Tue, Aug 11, 2009 at 9:20 PM, Ahmed Medhat <a.medhat...@gmail.com> 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 <akhilhan...@gmail.com> > >> >> 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:a.medhat...@gmail.com <e-mail%3aa.medhat...@gmail.com> > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-code@googlegroups.com To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---