On Monday, May 16, 2016 at 4:22:38 AM UTC+3, vladimirr...@gmail.com wrote:
> I've been programming in Java. Does it make sense to switch to C for integer
> or character-related problems?
I don't think so.
I am a Python programmer myself, but as far as I know, when it come to GCJ the
only benefit
On Wednesday, May 4, 2016 at 9:29:05 PM UTC+3, Amit Attia wrote:
> Hello,
> I'm new to competitive programming, currently at GCJ round 2. I program using
> python, but familier with cpp from university course. I want to switch, but I
> don't feel like my cpp skills are flexible enough for competi
On Sunday, April 10, 2016 at 8:45:43 AM UTC+3, Ameya Sunil Bongale wrote:
> Hello All,
>
> I just narrowly missed the deadline to register. Can someone help me find out
> if I can still register.
>
> Thanks
Better luck next year
--
You received this message because you are subscribed to the
n Tue, Jun 9, 2015 at 9:50 PM, Edward Lockhart wrote:
> Yes - see for example linguo's solution.
>
> He solved bilingual as an integer linear programming problem too.
>
>
>
> Edward
>
>
>
>
>
> > On 9 Jun 2015, at 21:09, bigOnion wrote
On Wednesday, June 10, 2015 at 2:37:00 PM UTC+3, M.H. wrote:
> > 1. Do you know if octave and GLPK run smoothly on windows?
>
> Yes, both of them run on Windows, however I experienced several
> 'corner-cases'. E.g., I am not aware if modern Octave GUI (introduced in
> 3.8.x) is already available
On Wednesday, June 10, 2015 at 10:16:19 AM UTC+3, M.H. wrote:
> >> I know that obviously coding a solution to LP is much harder than the
> >> simple analysis of this specific problem.
>
> I think, GNU Octave + GLPK are acceptable tools in this contest (as both of
> them are open-source and free)
During round 2 I recognized that problem B can be described as a Linear
Programming problem.
There are two restrictions:
R_1 * t_1 + ... + R_n * t_n = V
C_1 * R_1 * t_1 + ... + C_n * R_n * t_n = V * X
t_1, ..., t_n are all non-negative
Finally the objective is:
Minimize (max{t_1, ..., t_n} )
Hi all,
I suggest another approach for solving problem D of round 2. My approach does
not need any dynamic programming, but I do use combinatorial methods instead.
And also I do still need to enumerate in order to find solutions to some linear
equation.
Unfortunately for me, I thought about it
On Saturday, April 18, 2015 at 11:20:55 PM UTC+3, Неугомонный wrote:
> Hi, this must've been already asked here but I couldn't find any links,
> please refer to existing post if I'm repeating someone's question.
>
> What is the best way to prepare for this challenge? Just your thoughts in few
>
I meant "a specific context" and not "content".
--
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 gro
The analysis says that whenever you are left with a connected blank space (not
necessarily rectangular) whose size is divisible by X - then you can fill it up
with X-ominoes:
" If a connected blank area of size M is a multiple of X, it can be guaranteed
that there is a way to place M/X X-ominoe
You got the input wrong.
when you have two numbers in a row, it DOESN'T mean that the outbound must be
from left to right and the return flight from right to left. You can fly right
to left as outbound flight, and the return will be from left to right.
Notice the way the input was described in t
Such a post is just unfair towards the organizers.
They organize a competition. They do not organize a course.
If you really needed an explanation earlier, you could just post a question on
this very forum. I bet someone would be willing to give you a full solution
with additional explanation on
On Friday, April 25, 2014 12:50:05 AM UTC+3, Alex Polozov wrote:
> On Wednesday, April 16, 2014 1:29:22 PM UTC-7, Bartholomew Furrow wrote:
>
> > You must not have competed two years ago. We used to be way later. :-)
>
> >
>
> >
>
> > We'll get them up soon™, and email this list when they're
Hi,
Great contest!
I participate for quite a few times already. I found some questions in the
qualification round harder this year than previous ones.
Anyway, I was just checking
http://www.go-hero.net/jam/14/unknown
which shows the unidentified submissions in the qualification round.
It seems
Agree with Stanislav as well.
Although it seems counter intuitive, looking at code is NOT helpful. You have
to understand the analysis before looking at the code, otherwise you waste your
time. As these codes might have principles which are more advanced than simple
conditions/loops such as dyna
On Sunday, May 5, 2013 6:48:17 AM UTC+3, CoderBaba wrote:
> Well contrary to what Bartholomew Furrow said I think the violators should
> have been disqualified from Qualification round. In that case these emails
> would not have come in one after another.
>
In the qualification round it's not
Also the ones in ranks 955, 987 should be checked.
ICY, good job, but it might be the case that your script only compares programs
with the same extension. You should compare any two files no matter what the
extension is.
I actually don't have such program of my own, just looked at sources from
Also, wrong code for B by Kiwiluver75 (rank 959)
--
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 gro
19 matches
Mail list logo
