Why ?!
i prefer to be O(1) .. it will be faster :P
On Aug 13, 2:43 pm, Paulo Lúcio de Oliveira Júnior
<[email protected]> wrote:
> "please if u can contact TopCoder to see a solution for this problem"
>
> And please, a solution with an O(n) algorithm, hehehehe =D
>
> 2009/8/13 ahm.kam_92 <[email protected]>
>
>
>
>
>
> > Hi admins,
>
> > please if u can contact TopCoder to see a solution for this problem ..
> > as you know many TopCoder's joins the GCJ and there will be a problem
> > with this round.
>
> > Thanks for you attention.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
