Hi folks.
I don't know how to count... xD
The last test case of the sample, I'm counting 7 times, but it is showing 6.
0 5 , 5
0 1 - 1, 2
1 1, 3
4 7 , 4 , 7
5 6 , 6
Link for the problem:
Hi,
I understand that they're using binary search, but I don't know how can it get
to the solution.
Could someone be very nice and explain the code below, please?
This is from coder wata:
void solve() {
long left = 0, right = 1L 40;
while (right - left 1) {
No, I don't. 2012 champion used Java. xD
--
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 this group, send
Hi.
Many times the Contest Analysis doesn't contain a working solution.
I know that we can see the solutions from other coders, but many times is hard
to understand their codes: no comments, variable's names ...
It would help a lot if Code Jam provide us with a working solution with a lot
of
I'm impressed that many favourites couldn’t make up to the finals:
bmerry, meret, rng..58
I think Gennady.Korotkevich will win, but the others are strong too. It'll be
exciting! =D
--
You received this message because you are subscribed to the Google Groups
Google Code Jam group.
To
On Saturday, June 15, 2013 7:51:38 PM UTC-3, newbie007 wrote:
I'm impressed that many favourites couldn’t make up to the finals:
bmerry, meret, rng..58
I think Gennady.Korotkevich will win, but the others are strong too. It'll be
exciting! =D
Other interesting things are that China
Gennady.Korotkevich was the favorite, but he didn't participate. Does someone
know why?
And big congrats to mystic!!!
Thanks in advance.
--
You received this message because you are subscribed to the Google Groups
Google Code Jam group.
To unsubscribe from this group and stop receiving
Hi,
If in the second arrangement, the cards from the first chosen row are not all
in different rows, then he IS a Bad magician!
I know that the magician may be luck and still be able to find the card
depending on the volunteer choices, but it doesn't change the fact that he IS a
Bad magician!
Hi,
In the problem's analysis they mention the use of backtracking to solve the
problem:
https://code.google.com/codejam/contest/2974486/dashboard#s=aa=2
They also say that it's an easier approach, but maybe it's harder to validate
if the configuration is valid than enumerate the corner cases?
https://code.google.com/codejam/contest/3264486/dashboard#s=p3
[quote]
...
x+o
.+.
The middle row has a pair of models (x and o) that does not include a +.
[/quote]
I didn't understand this part.
The middle row HAS a +
:(
--
You received this message because you are subscribed to the Google
is 0 midnight?
is 1440 midnight?
why if C (0-720) and J(720-1440) is not only ONE exchange?
I didn't understand sample case 3:
2 2
0 1
1439 1440
1438 1439
1 2
time taking care of the baby:
James..: 0-1, 720-1438, 1439-1440
Cameron: 1-720, 1438-1439
I counted 4
Hi,
Many coders use code like this:
int q[N][N], ptr[N];
and then:
q[i][ptr[i]]
It was used a lot to solve Ratatouille
https://code.google.com/codejam/contest/5304486/dashboard#s=p1=1
I am a newbie, but it seems like an efficient way to keep state(?)
when do you use such approach?
Thank
Usually in the qualification round the first two problems are simple and with
no tricks.
I got A and B correct for the small data sets, so I assumed it was fine.
But then wrong for A large and time exceed for B large. Oo
Probably I was too careless, but I think CodeJam missed the qualification
after some minutes the solutions are in submissions, even though it says a
"problem occurred"
--
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
14 matches
Mail list logo