This was my favorite problem, since the solution is so easy
and yet many people were confused.
They also gave a complex example for the 3rd sample input even though
there is never a need to hold down any element not in it's position.
Statistically this was the hardest problem with only 58% solving
You should think of the time complexity of your algorithms,
If you solved problem C small with time complexity n^2 (as I
suspect,without looking at your code)
It would work well for small input but not for large.
Most solutions I saw(including my own) worked in n*log(n) time which
is fine for the l
ve for n=10^100
So in short, pick a language for coding time not run time.
Meir
On Sunday, April 14, 2013 9:54:04 AM UTC+3, Olaf Doschke wrote:
> The speeds of C/C++ are quite equal. Since C++ is the advanced language, I'd
> prefer it. C might win, but for a high price of offering
Not compiling the code on the server is a huge advantage,
it allows writing in any language, or a mixture of languages.
And gives users complete control of the runtime.
It also simplifies the server side significantly both less server resources
and no need to worry about sandboxing rouge code.
O
I was expecting a contest analysis by now but didn't see one
so I'll try this way.
Though I didn't participate in round 1A I tried to solve the Good Luck problem
but only get ~10% correct with the parameters of the second input
and wanted to share my approach and ask for comments.
First I find all
Summing the log of the count is equivalent to multiplying them, I was using
Long and not BigInt, It is conceivable there was a simple numeric overflow.
On Monday, April 29, 2013 4:37:09 AM UTC+3, Nate Bauernfeind wrote:
> A correct answer I read through was very similar and I tried rewriting it
On Monday, March 24, 2014 10:04:17 PM UTC+2, Shivang Gupta wrote:
> Hi,
>
> Are the solutions judged for performance as well, in terms of lines of code,
> or execution time, or memory footprint, etc.? Has anybody ever run into a
> problem where they had to be careful about this aspect, specially
is to give much fewer points to the small inputs,
unless there is some real challenge there.
All in all Code Jam ha a great format which keeps me coming back year after
year.
Looking forward to compete next year.
Meir
On Thursday, October 9, 2014 1:46:32 AM UTC+3, Bartholomew Furrow wrote:
If you take your solution for small, and just replace the multiplier
by min(M,12 + M % 12) (can probably be made tighter)
you should be able to solve the large in time.
I also checked the product of the input suffix matches the product of the
output but I'm not sure this is required to meet the
It's not about getting to the final round.
The final round is only 25 people, and there are ~12000 still competing, out of
more then 50K people registered.
Obviously the vast majority of us won't make it to the final round, that
doesn't mean we won't have fun.
I believe almost all those who mak
The statement is correct.
When you aren't required to use a specific X-omino it is easy
to fill any connected shape divisible by X with X-ominos.
Only being required to use a specific X-omino causes problems but that is not
the case with the quoted statement.
On Wednesday, April 15, 2015 at
Clarification, you can do it when it is a rectangle with a jotted line through
it. more complicated shapes can be an issue even without a required X-omino.
On Wednesday, April 15, 2015 at 5:17:59 PM UTC+3, meir wrote:
> The statement is correct.
> When you aren't required to use a
omino, and we preserver the 0 modulo x result.
So we can fill until the end.
On Wednesday, April 15, 2015 at 5:20:53 PM UTC+3, Paul Smith wrote:
> No meir, that's not true.
>
>
>
> #X#
> XXX
>
>
> The 4 Xs are connected. 4 is divisible by 2, but you ca
I did not solve problem B during the contest, so I read the solution by pashka
and annotated his code according.
The basic approach is to allocate empty rooms so as to maximize the number of
noisy walls they reduce, 4 walls removed,then 3 walls and finally 2 walls.
This is the code by pashka, I
I understand how to construct a correct solution, yet there are many correct
solutions and It alludes me how this was verified?
Did you attempt to construct a contradicting example, is this something which
is guaranteed to catch all incorrect submissions?
--
You received this message because
;0?" sub-sequence any trailing 1s with the final 1 and a correct number
of "?" from the first program. and with alternating "10" of sufficient length
and the "?" from first program it should be possible to produce any prefix.
What is wrong with my analysis/co
On Saturday, June 11, 2016 at 8:56:00 PM UTC+3, eatmore wrote:
> Each program must contain at least one instruction.
Thank you, can't believe I missed it. I was starring at this for the last hour
of the competition. The fix is trivial and I just checked it on practice it
works:
val Array(n,
So It's been two weeks and still no analysis for GCJ round 3.
I thought I'd start a thread with the aim to cover all questions of round 3.
I will start with what I know, and hope someone will add an explanation to the
tougher problems.
Problem A was fairly simple with nearly everyone in the c
On Tuesday, January 31, 2017 at 6:30:29 PM UTC+2, Ahmed Layouni wrote:
> Was wondering if the contest could qualify top contestants for O1/EB1 visa?
> and if so what percentile threshold would be required?
>
> Thanks!
The criteria for O1 visas aren't very specific, and obviously code jam can't i
I noticed only 31% correct in large attempts for Stable Neigh-bors.
Where were the pitfalls causing so many to think they had a solution but still
fail somewhere, are there extra edge cases.
I can see many edge cases you can miss which will affect both small and large
but don't see edge cases ex
ion not as
mandatory.
I don't see how the change levels the playing field, unless you go with much
larger inputs, the language differences are still very significant, trumping
hardware variability.
Meir - an unhappy code-jammer.
--
You received this message because you are subscribe
As we are forced to run on Google servers will common libraries be made
available?
For instance in Java I would like&expect guava collections and
appache-commons-*
Also, I was thinking other JVM languages could be sort of supported by adding
their library in and having contestants "compile"
I seem unable to find a way to look up another player in the scoreboard.
I used to do this, to track both real life friends and other notable
competitors I become aware of.
Is this feature missing from current incarnation? or am I just not seeing it?
--
You received this message because you a
I would recommend publishing test files after the round.
For the interactive this is insufficient but if the testing code is reasonably
independent we could ask it be published as well after the round.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam
I was happy to see Scala was added to the supported languages. It's my language
of choice and writing in a language I don't use daily not only slows me down it
isn't as fun.
I was unable to use Scala at all in the qualification round. I wrote short
O(input length) solutions for the first two pr
Here are the first two solutions I wrote in Scala:
import java.io.BufferedReader
import scala.io.Source
/**
* Created by meir on 06/04/19.
*/
object Solution {
val not4 = "[^4]".r
def processTest(in: BufferedReader): String = {
val n = i
On Sunday, April 7, 2019 at 11:22:55 PM UTC+3, Nate Bauernfeind wrote:
> Hmmm. These solutions are correct? I thought a and b had to be positive.
> Thought for sure zero was not allowed based on the description.
Since there is for sure at least a single '4' in the original a and b are both
posit
ll values of n given in the input.
>
>
>
> Le mar. 12 avr. 2016 à 14:39, meir a écrit :
>
>> I understand how to construct a correct solution, yet there are many
>> correct solutions and It alludes me how this was verified?
>> Did you attempt to constr
28 matches
Mail list logo
