A brief outline:
Problem A:
If A=1, no motes can ever be eaten, so the answer is you have to remove all N.
On the other hand, if A>1, suppose that in the optimal solution you remove k
motes. It seemed intuitive to me that the k motes you remove would be the
largest k and that for the others wh
Dear Bartholomew,
Is it possible to have a "virtual contest mode" in the future that we can
"compete" with the contestants in the past contests? I may not be eligible to
play in that round but I could join that after the contest. The scoreboard will
be updated from time to time according to the
Atleast the response can be a list of testcases that failed.
Then we can debug at out end.
In my case Question1 had 6 incorrect test cases of 100. Very low
probability that i will pick the incorrect test case to debug
On Sun, May 5, 2013 at 4:56 AM, Andres Felipe Ruiz wrote:
> This is one of th
@Betlist: That is a neat diagram you posted. What tool did you use to
generate it?
On 4 May 2013 23:33, Joseph DeVincentis wrote:
> In your cases with 10 diamonds, you have probabilities of 1/16, 4/16,
> 6/16, 4/16, and 1/16 of being in the respective cases. To get to the first
> case with 11 d
Damn! How lame ! Better not selected than being Disqualified !
On 4 May 2013 23:48, Radin Ahmed Ehsan 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 aft
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.
On Sun, May 5, 2013 at 2:47 AM, bigonion wrote:
> Also the ones in ranks 955, 987 should be checked.
>
In your cases with 10 diamonds, you have probabilities of 1/16, 4/16, 6/16,
4/16, and 1/16 of being in the respective cases. To get to the first case
with 11 diamonds, if you are in the 1/16 case, you will always go there,
and in the 4/16 case, you will go there half the time, so the correct
proba
Introduce 2 to get to 5, introduce 4 to get to 9, introduce 8 to get to 17,
and then eat the motes.
On Sat, May 4, 2013 at 8:30 PM, Mutley wrote:
> On Saturday, May 4, 2013 12:09:49 PM UTC-7, Mutley wrote:
> > Can someone please run this and let me what test cases fail? My code had
> no problem
This is one of the objectives of Programming Contest. Contestants should be
able to identify all corner cases. As far as I am concerned, It just the
way it should be.
On Sat, May 4, 2013 at 3:39 PM, Lei Huang wrote:
> Small tests could submit multiple times and give you the input files. I
> thi
On Saturday, May 4, 2013 12:09:49 PM UTC-7, Mutley wrote:
> Can someone please run this and let me what test cases fail? My code had no
> problems with the sample test cases provided for Problem A. Thanks in advance.
>
> Here is my small dataset:
>
> 100
> 3 8
> 5 6 9 4 8 2 1 7
> 3 1
> 2
> 3 10
On Saturday, May 4, 2013 1:53:56 PM UTC-7, porker2008 wrote:
> also Jasraj (rank 955). Same B Small
>
> On Sunday, May 5, 2013 3:07:37 AM UTC+8, ICY wrote:
> > samarth3692 and HARSH94 have identical B-small solutions (ranks 981, 984).
> > prakhar120793 (rank 950) had a wrong code attached to B-sma
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
Hello programmers,
I have question to correct answer for test case
11 1 3
for round 1B, problem B
(https://code.google.com/codejam/contest/2434486/dashboard#s=p1).
It seems that accepted answer is 6/32 = 0.1875 but according to my
understanding the correct answer is 5/30 = 0.16667.
I dra
"The small dataset should test if the coder didn't hard coded the solution."
Among other things.
--
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+
This time I was completely knocked out. I knew how to solve them but ended
up spending time in debugging. Can't wait for the Contest Analysis.
Any idea when they will be out?
--
Jugesh Sundram
(jugeshsund...@gmail.com)
--
You received this message because you are subscribed to the Google Group
yes, I got that now, thats what I did earlier
--
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,
I think it should be (1+4+6)/16 = 11/16 = 0.6875
On Sunday, May 5, 2013 5:30:55 AM UTC+8, zach polansky wrote:
> Yup! I noticed that small limits were very small, and I computed all of the
> individual probabilities by hand that were not 1 or 0. I did (1+4+6)/32 =
> (12)/32 and couldn't find my
Yup! I noticed that small limits were very small, and I computed all of the
individual probabilities by hand that were not 1 or 0. I did (1+4+6)/32 =
(12)/32 and couldn't find my mistake
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To un
also Jasraj (rank 955). Same B Small
On Sunday, May 5, 2013 3:07:37 AM UTC+8, ICY wrote:
> samarth3692 and HARSH94 have identical B-small solutions (ranks 981, 984).
> prakhar120793 (rank 950) had a wrong code attached to B-small solution.
--
You received this message because you are subscribed
also romeo (ranks 987)
They have the same B small with samarth3692 and HARSH94
On Sunday, May 5, 2013 3:07:37 AM UTC+8, ICY wrote:
> samarth3692 and HARSH94 have identical B-small solutions (ranks 981, 984).
> prakhar120793 (rank 950) had a wrong code attached to B-small solution.
--
You recei
Small tests could submit multiple times and give you the input files. I
think it is generous enough for contestants.
Lei Huang
Master Student of Computer Science
UCLA
On Sat, May 4, 2013 at 1:35 PM, porker2008 wrote:
> I don't see why this case is special.
>
> It is a very general case.
>
> Pa
When considering removing: min + (motes.length - i - 1)
I just removed -1, then it works.
On Sat, May 4, 2013 at 5:35 PM, porker2008 wrote:
> I don't see why this case is special.
>
> It is a very general case.
>
> Parker
>
> On Sunday, May 5, 2013 4:33:39 AM UTC+8, newbie007 wrote:
> > If the
I don't see why this case is special.
It is a very general case.
Parker
On Sunday, May 5, 2013 4:33:39 AM UTC+8, newbie007 wrote:
> If the sample had the case below I would be able to solve it. sad ... :'(
> Input Output: 2
>
>
> 11 2
> 26 28
>
>
>
>
>
>
>
>
> On Sat, May 4, 201
If the sample had the case below I would be able to solve it. sad ... :'(
InputOutput: 2
11 2
26 28
On Sat, May 4, 2013 at 3:58 PM, Luke Pebody wrote:
> In my humble opinion, Code Jam covers edge cases in their samples much
> much more than Topcoder. In Topcoder, I might have been car
I already know why you have that wrong output. Did you figure it out by
yourself?
:)
Parker
On Sunday, May 5, 2013 4:26:21 AM UTC+8, zach polansky wrote:
> N!
> 2 cases away from round 2!
> D:
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam"
N!
2 cases away from round 2!
D:
--
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 em
Good job.
How do you detect or what tools did you use to find out those cheaters?
:)
Parker
On Sunday, May 5, 2013 3:07:37 AM UTC+8, ICY wrote:
> samarth3692 and HARSH94 have identical B-small solutions (ranks 981, 984).
> prakhar120793 (rank 950) had a wrong code attached to B-small solution.
Hi,
The first column is my results and the second is yours.
Cheers,
Case #6: 3 Case #6: 5
Case #7: 7 Case #7: 10
Case #9: 2 Case #9: 3
Case #10: 5 Case #10: 6
Case #17: 2 Case #17: 8
Case #19: 1 Case #19: 3
Case #20: 3 Case #20: 5
Case #21: 2 Case #21: 3
Case #24: 2 Case #24: 5
Case #27: 4 Case
Case #6:
Doesn't require 5, for example. Others outputs are wrong as well.
On Sun, May 5, 2013 at 12:39 AM, Mutley wrote:
> Can someone please run this and let me what test cases fail? My code had
> no problems with the sample test cases provided for Problem A. Thanks in
> advance.
>
> Here is
Can someone please run this and let me what test cases fail? My code had no
problems with the sample test cases provided for Problem A. Thanks in advance.
Here is my small dataset:
100
3 8
5 6 9 4 8 2 1 7
3 1
2
3 10
2 4 8 16 32 64 100 100 100 100
3 10
1 4 4 4 4 4 4 4 4 4
100 1
100
3 5
11 20 60 2
samarth3692 and HARSH94 have identical B-small solutions (ranks 981, 984).
prakhar120793 (rank 950) had a wrong code attached to B-small solution.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receivi
In my humble opinion, Code Jam covers edge cases in their samples much much
more than Topcoder. In Topcoder, I might have been careless and not notice
the infinite loop my solution went into in tonight's problem 1 if A = 1.
Whether this is "better" or "worse" is a separate debate, but definitely I
yup, one wrong index increment killed my Question 1. :(
On Sun, May 5, 2013 at 12:21 AM, Niraj Kumar wrote:
> there may be many edge cases which is not covered in sample, but we need
> to take care it.
>
>
>
> Regards,
>
> *Niraj Kumar*
>
> B.Tech. CSE
> Class of 2012
> ISM, Dhanbad
> 82749523
there may be many edge cases which is not covered in sample, but we need to
take care it.
Regards,
*Niraj Kumar*
B.Tech. CSE
Class of 2012
ISM, Dhanbad
8274952350
On Sun, May 5, 2013 at 12:11 AM, Leandro Coutinho
wrote:
> The small dataset should test if the coder didn't hard coded the sol
My Accepted Program shows that
Case #15: 0.6875
Case #24: 0.6875
On 2013/5/5 2:33, zach polansky wrote:
Can someone tell me what is wrong???
Input:
100
20 -2 4
3 -2 0
12 0 0
14 4 0
18 2 0
10 -4 0
5 0 2
16 0 0
18 0 4
11 0 0
17 0 2
15 4 0
6 -1 1
6 -2 2
10 3 1
5 0 2
1 0 682
10 2 2
5 9996 0
12 2 0
The small dataset should test if the coder didn't hard coded the solution.
The large dataset should test if the algorithm is efficient enough.
So if the solution is not hard coded and could solve the sample, it should
be able to solve the small dataset at least.
It's very frustrating when the outp
Can someone tell me what is wrong???
Input:
100
20 -2 4
3 -2 0
12 0 0
14 4 0
18 2 0
10 -4 0
5 0 2
16 0 0
18 0 4
11 0 0
17 0 2
15 4 0
6 -1 1
6 -2 2
10 3 1
5 0 2
1 0 682
10 2 2
5 9996 0
12 2 0
14 -1 3
4 1637 3881
5 0 4
10 3 1
5 -2 0
10 2 2
6 4 0
16 1747 2953
16 -6 0
14 1379 9755
1 0 2
16 -4 0
14 0 0
Hate to be the guy always siding with the big multinational corporations,
but Visual Studio Express (
http://www.microsoft.com/visualstudio/eng/products/visual-studio-express-products)
is awesome.
On Sat, May 4, 2013 at 3:50 PM, LeppyR64 wrote:
> I use Notepad++ with some NPPEXEC scripts to com
I use Notepad++ with some NPPEXEC scripts to compile, execute code and display
results.
My compiler is the MinGW project of GCC.
--
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 i
Yes. Round 1A, 1B, and 1C are scheduled around different time zones. Once you
get to round 2 and beyond this is not an option.
For example 1B is in 1 hour and 15 minutes. 1C will be in about a week.
--
You received this message because you are subscribed to the Google Groups
"Google Co
I also ran the given solution after converting it to python 3, here are the
results
[madura@trex-j ~]$ time python3 g.py < Downloads/A-large-practice.in >
/dev/null
real0m1.952s
user0m1.927s
sys 0m0.023s
- Madura A.
On Sat, May 4, 2013 at 7:26 PM, Madura Anushanga wrote
True, someone asked the same problem on the blog, here's my reply to him,
"True enough, I’ve assumed sqrt() to be O(1) which is comparatively correct
because other operations take a lot of time comparatively. I do not change
precision while running its changed only once, all other operations are
O
Correct me if I am wrong, but
The answer to your question is given by yourself, it relies on the arbitrary
precision arithmetic of Decimal module of python, which is doing all the work.
and infact your solution is slower than the one given in the analysis. The
given solution works in logarithmic
@San
Here is my solution which is O(1)
http://0xdeafc0de.wordpress.com/2013/04/30/gcj-2013-r1a-bullseye-o1-solution/
- Madura A.
On Sat, May 4, 2013 at 4:54 PM, Sann wrote:
> On Friday, May 3, 2013 11:34:48 PM UTC+5:30, Bjarki Ágúst Guðmundsson
> wrote:
> > Why is the O(1) solution
On Friday, May 3, 2013 11:34:48 PM UTC+5:30, Bjarki Ágúst Guðmundsson wrote:
> Why is the O(1) solution to Problem A (Bullseye) not presented in the Contest
> Analysis?
Please share the code.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
did you include gmp?
#include
also when compiling dont forget to link
g++ main.cpp -lgmp
--
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+unsubs
hi all,
can some one post detailed instructions to install and use GMP for c++ on UBUNTU
i like to use sudo apt-get install (i already used sudo apt-get install
libgmp3-dev but no avail, it showing compile time errors "mpz_class’ was not
declared in this scope")
please help me
--
You recei
48 matches
Mail list logo
