That's some typing ability you've got there. Respect.
Don't avoid loops. The overhead of a loop is miniscule; it'll never make a
difference in codejam. What's more, your compiler can unroll loops if
necessary to optimize the target code. Have a look here:
http://en.wikipedia.org/wiki/Loop_un
Any idea when the contest analyses for rounds 1b and 1c will be published?
(I'm not complaining about them not being available, since I know that you're
all hard working engineers, I was just wondering when I should look for them.)
--
You received this message because you are subscribed to t
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, 2013 3:53:54 PM UTC-7, Mohammed Kaja nawaz l.j wrote:
> YaIt's the problem which is asked in one of the eminent company for
> coding competiti
How likely is it that more languages will be added for this year's competition?
I'm most interested in Rust, but I think there are other languages that people
are interested in. D, Ocaml, and Scala, for instance have fans and are
supported by codeforces among other judges.
--
You received
safe way. When we make any
> changes to the list of available languages, people on this list will be among
> the first to know about it!
>
>
> Best,
> Pablo
>
>
> On Thu, Jan 31, 2019 at 3:45 PM Rob Lachlan wrote:
> How likely is it that more languages will be add
Briefly,
If you got the visible test, you probably know that all you need is the factors
for one of the numbers, and the rest can all be got one by one out from that
number.
The key to the large numbers is realizing that GCD is much easier to do than
factoring in general. So if you have two
I think that there is a problem with the Julia environment in codejam right now
which didn't exist during the qualification round. I ran into this problem
when I got RE during round 1B for the crepe cart problem, but I don't think its
simply a case of "it runs on my machine, not in yours."
I
