@*Xiongqi ZHANG*
Sorry for being off topic. But how to get the code formatting in-mail ?
On Thu, Apr 9, 2015 at 11:06 AM, Luke Pebody wrote:
> Quick code review:
>
> 1. Your use of .replace("\n", "") is to get rid of an ending newline. It
> is more pythonic to use .strip()
>
> 2. Suggest defini
nt. Who came to this forum asking for help
>> in this way is not going to win.
>>
>> Carlos Guía
>>
>>
>> On Tue, Aug 13, 2013 at 10:17 AM, Malay Keshav wrote:
>>
>>> Its from an ongoing contest by TCS with a prize money.
>>>
>>>
Its from an ongoing contest by TCS with a prize money.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to google-code+unsubscr...@googlegroups.com.
To post to th
And its not even a programming competition, its just the practice round
before it.
On Thu, Aug 8, 2013 at 8:38 PM, Rob Lachlan wrote:
> So what you're saying is that you're cheating in a coding competition, and
> you'd like people on this list to help you cheat?
>
>
> On Wednesday, August 7, 20
That should have worked. I had used the same logic.
My complexity was coming out to be O(t*(5^(n-1))) [where t is the number
of test cases and n is the number of activities on his calendar ].
With small optimisations such as checking whether the given calculated
values of 'to spend energy' are val
They have used a binary search , since the function relating radius ,
number of circles and the amount of paint was strictly non decreasing.
On Sat, Apr 27, 2013 at 2:12 PM, Vaibhav Tulsyan
wrote:
> I was seeing the solutions of the top 10 contestants for the large input
> of Bull's Eye. They al
I just tried uploading your output for both the large and small dataset ..
Both of them gave a correct response by the judge ...
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it,
Your code should be working fine.Your output matches with one generated by
my code for both the large and small dataset.. Are you sure the judges
response is incorrect ?
On Tue, Apr 16, 2013 at 6:35 AM, Baris Acar wrote:
> A simple way to troubleshoot is to download a correct solution and execu
The qualification round is based on getting a minimum score, while the rest
of rounds are based on rankings.
To qualify the first round you must be in the top 3000
So,
Round 1A -> Top 1000 qualify to Round 2
Round 1B -> Top 1000 qualify to Round 2 (Apart from the ones who already
qualified in Roun
I have gone through and understood the RMQ Sparse Tree algorithms from
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor.
They have also provided an example problem for the same
http://poj.org/problem?id=2374 But i am unable to apply the RMQ (Sparse Tree
Algorithm)
woops...sorry ^^'
Thanks for the output..
--
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.co
11 matches
Mail list logo
