Heyy, Thanks a lot.. can you teach me how can I make my code efficient enough
so that it can pass second test too?
--
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
You are welcome :D
--
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 view this discussion on the web visit
Hello,
I do not understand what was my mistake for the overexcited fan problem.
Is it possible to have the test set input 1 now that the challenge is over ?
My strategy was to move east until I will be on the same vertical axis that
the goal and then wait if the next step of the goal would be
Hey,
During round 1C I got a runtime error that I'm curious about. I attached my
code below:
Basically I create a dictionary with 1's representing possible values. This
lets me figure out by reverse elimination which digit represents which
values (the count in the end).
On my machine it
I couldnt come up with a solution that could solve Test set 3, I didnt know
Benford's law even existed.
But I was able to come up with an Algo for Test set 2
I thought I could throw in a tiny optimization (return if result already
found) into my algorithm but it gives an incorrect answer.
Ahh... that was it
Thanks :)
On Friday, May 1, 2020 at 7:57:13 PM UTC+2, porker2008 wrote:
>
> Try this case
>
> Input:
>
> *1*
> *2*
> *R*
> *S*
>
> Expected Output:
> *Case #1: RP*
>
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To
