before ours and have us not
take it into account, or vice versa?
On Sun, May 22, 2011 at 6:35 PM, TripleM stephenmerri...@gmail.com wrote:
Are the Code Jam organisers aware that the GCJ onsite finals are
scheduled for the last day of the IOI (http://www.ioi2011.or.th/
detailed_schedule
Are the Code Jam organisers aware that the GCJ onsite finals are
scheduled for the last day of the IOI (http://www.ioi2011.or.th/
detailed_schedule)? While the 29th is the 'departure day', trying to
get from Thailand to Japan in a single day, not including a 2 hour
time difference or time to
Numerical approaches like the one you suggest are always possible
solutions to problems like these, but I'm afraid in this particular
case they have absolutely no hope of giving the answer to the required
accuracy.
You say that 'as a safety margin we may have to go for 10^-7 or so'
when deciding
They are text files. You can open it with any text editor, including
the ones you mentioned.
On Jun 2, 3:22 pm, sam ultimatechoice2...@gmail.com wrote:
hello everyone . best of luck for your competitons.
Can ayone please tell me how open the .in extension files(small.in
and large.in)
provided
Yes.
On May 28, 4:52 pm, Ketan Joshi ketan.s.jo...@gmail.com wrote:
Thanks guys,
Just one thought though,
The order of keys is a side-effect of the implementation. Was it really the
specification for maps implementation?
~Ketan
On Fri, May 28, 2010 at 12:22 AM, Lev Neiman
'11' is definitely happy in base 2. The square of the digits add to
'10' in base 2; the squares of those digits add to 1.
On May 25, 8:11 pm, maverick gugu maverick.g...@gmail.com wrote:
Hi,
i think i'm misinterpreting this question from that time. In the test
cases given in the question:
isn't great and there is scope of improvement,
or if I know that I have to convert my algorithm to a faster language like
C/C++.
On Fri, May 21, 2010 at 12:27, TripleM stephenmerri...@gmail.com wrote:
I wouldn't interpret it that way at all. It makes perfect sense to me
I should just point out that it is perfectly possible/likely wata's
solution gave the correct answers to the small input he was provided
with. A friend of mine failed to solve B-small despite 5 submissions;
when he sent me his code it gave perfect results on the first small
input I downloaded.
On
I wouldn't interpret it that way at all. It makes perfect sense to me
- it is extremely easy to have a tiny bug in your algorithm that
invalidates your entire effort. These tiny mistakes are picked up in
the small submissions; once you have got that correct you are expected
to be able to solve the
algorithm may succeed.
The test cases are deliberately designed so that this is never the
case. A simple algorithm which performs badly on the worst possible
input will not be good enough to solve the problem.
On May 21, 9:26 pm, Abdelrhman Abotaleb profvip.abota...@gmail.com
wrote:
@TripleM
No;My
Nope.
On May 22, 4:15 pm, Mark Hurd markeh...@gmail.com wrote:
In the end I only submitted small and large Problem A for Round 1A.
Both have been marked as Correct (and I took too long so I wasn't in
the top 1000).
For me the small Correct is highlighted (background) in green. Does
that
While using fmod(k+1,pow(2,n)) will work in this case, it is most
definitely not a good idea. Suppose the bounds were a bit bigger so
that 64 bit integers were required, rather than just 32-bit ones.
Then pow(2,60) is equal to 1152921504606847000, while 1LL60 is
1152921504606846976.
You should
You will get an email once the first round scoreboard has been
finalised. Which isn't yet, with the huge number of submissions.
On May 16, 2:18 pm, tonka ritwik.sami1...@gmail.com wrote:
i guess we just show up...i didn't get any invitation yet...
On May 16, 1:01 am, Brian Watkins
While you're at it, take the competition at 5am. The same day daylight
savings hits and you're meant to move the clock forward one hour at
2am the same morning.
On Sep 23, 3:48 pm, Brian Watkins wildu...@gmail.com wrote:
Well, my favorite computer died this past weekend. And it'll take
Anything to 7 decimal places is still within a precision of 10^-6, so
the analysis is correct, and it won't be a typo. It is common to allow
for much higher precision than asked for just in case you had an off-
by-one error somewhere.
On Sep 15, 9:01 pm, Matteo Landi landima...@gmail.com wrote:
I'm afraid you can't. Not many people will want their email addresses
given out publicly.
On Sep 14, 4:24 pm, LeMyPhuong phuongem...@gmail.com wrote:
I'm Java beginner and I'm new to codejam. I 've downloaded some solutions
written in Java but I cannot understand clearly the source code.
pow is a floating point function, not an integer function, and doubles
can not always store integers exactly. It is quite possible that it
returns xxx.999 rather than an exact integer, and that will round
down to the wrong value. You will also get in trouble comparing
doubles for the same
17 matches
Mail list logo
