Re: [code jam] Code Jam Round 1B is happening soon!

Yes On Mon, 26 Apr 2021, 14:27 Louis Yang, wrote: > Are we allowed to talk about the solution to the contest after the round > finished? > > lu...@pebody.org 在 2021年4月25日 星期日上午8:41:45 [UTC-7] 的信中寫道： > >> Good luck everybody! >> >> On Sun, Apr 25, 2021 at 4:32 PM 'Chelsea Lieb' via Google Code Ja

Re: [code jam] Code Jam Round 1B is happening soon!

chance > of working, then submit until they succeeded. The DP solution is... a > little more elegant. > > On Sun, Apr 25, 2021 at 9:41 AM Luke Pebody wrote: > >> Good luck everybody! >> >> On Sun, Apr 25, 2021 at 4:32 PM 'Chelsea Lieb' via Google Code Jam &l

Re: [code jam] 2021 Round 1A - Hacked Exam

Basically, your strategy for a given question might as well depend only on which of the candidates agreed with each other on the answer. (In that for any two questions with the same agreements, agreeing with candidate 1 has the same expected score, and since expectation is linear, you might as well

Re: [code jam] Code Jam Round 1B is happening soon!

Good luck everybody! On Sun, Apr 25, 2021 at 4:32 PM 'Chelsea Lieb' via Google Code Jam < google-code@googlegroups.com> wrote: > Hi, > > Code Jam Round 1B is starting soon! Visit the schedule page > to see > rounds in your browser's loc

Re: [code jam] Code Jam 2021 - Round 1A - Problem B - Magic number 3025

3025 is 31+499x6 and 31*499^6 is just lower than 499*10^15, while 37*499^6 is more than it. On Sat, 10 Apr 2021, 10:55 Luke Pebody, wrote: > The reason the number is not actually as high as 29940 is because 499^60 > is WAY larger than 2^60. > > > > On Sat, 10 Apr 2021, 1

Re: [code jam] Code Jam 2021 - Round 1A - Problem B - Magic number 3025

The reason the number is not actually as high as 29940 is because 499^60 is WAY larger than 2^60. On Sat, 10 Apr 2021, 10:47 priyank doshi, wrote: > > There is a magic number 3025! In problem analysis, it is mentioned that > the actual maximum possible sum of the second group numbers is 3025 u

Re: [gcj] Round 1B 2020 Blindfolded Bullseye: method of finding initial point in dartboard

One possible issue in your problem is you don't check any of the initial queries for if they are equal to 'CENTER' On Wed, 22 Apr 2020, 16:32 Arti Schmidt, wrote: > In Round 1B 2020 I'm getting TLE on test set 3 for Blindfolded Bullseye > using nearly the same strategy explained in the analysis

Re: [gcj] Cryptopanagram problem: sample failed RE

Case #{1} looks funny to me. Shouldn't it be Case #{k}? On Fri, Mar 13, 2020 at 7:47 PM Benjamin Ononogbu wrote: > Hi every one i recently registered for the code jam 2020, so i was trying > my hands on some past problem like the Cryptopanagram > but when i post my solution, the online judge kee

Re: [gcj] Registration is open! New scoring rules

n receive points for the Hidden Verdict Test Set. > > On Tue, Mar 10, 2020 at 9:21 AM Luke Pebody wrote: > >> I think you mistyped Situation B? Seems to be the same as Situation C. >> >> On Tue, 10 Mar 2020, 15:15 Bartholomew Furrow, wrote: >> >>> I just got

Re: [gcj] Registration is open! New scoring rules

I think you mistyped Situation B? Seems to be the same as Situation C. On Tue, 10 Mar 2020, 15:15 Bartholomew Furrow, wrote: > I just got an email from the Code Jam Team. It said: > > 1. Registration is open. Presumably you can access that at > https://g.co/codejam. > 2. There are small changes

Re: [gcj] Python/pypy viability for future Codejam rounds

No On Wed, 1 May 2019, 1:46 pm Alex Wice, wrote: > @Luke Are you a codejam staff member? > > On Tuesday, April 30, 2019 at 11:09:42 PM UTC+9, Luke Pebody wrote: > > Also, no the problems are not specifically tested to be solvable in > Python > > > > > > On T

Re: [gcj] Is the scoring rule strange？

Yes, this is correct. On Wed, 1 May 2019, 1:46 pm 姚炫容, wrote: > Bartholomew Furrow於 2019年4月30日星期二 UTC+8下午11時09分58秒寫道： > > During the contest, you can't see whether you solved hidden inputs > correctly or not. The score you see on the scoreboard, which I'll call your > "apparent score," is what y

Re: [gcj] Python/pypy viability for future Codejam rounds

id[otherp].above(indx-1) lowEnough = stillValid[otherp].below(indx+1) sc = scr(indx, lowEnough, highEnough, tooLow, tooHigh) tot += sc w -= 1 print "Case #{}: {}".format(cn, tot) if (cn == -1): break On Tue, Apr 30, 2019 at 3:09 PM Luke Pebody

Re: [gcj] Python/pypy viability for future Codejam rounds

Also, no the problems are not specifically tested to be solvable in Python On Tue, 30 Apr 2019, 3:08 pm Luke Pebody, wrote: > I did Problem C large in Python > > On Tue, 30 Apr 2019, 3:05 pm Alex Wice, wrote: > >> In 2019 round 1B, problem C large doesn't seem to be po

Re: [gcj] Python/pypy viability for future Codejam rounds

I did Problem C large in Python On Tue, 30 Apr 2019, 3:05 pm Alex Wice, wrote: > In 2019 round 1B, problem C large doesn't seem to be possible with Pypy. > If this is true, are the problems not specifically tested to be possible > with Python? > > -- > You received this message because you are s

Re: [gcj] GCJ 2019 Qualification Round: Cryptopangram; help me resolve RE status

What is RE? If you are running out of time, it could be because the primes are too big to find by trial division. On Mon, 8 Apr 2019, 6:33 pm ACTECH, wrote: > Hi, > Can you provide any specific testcases which you considered? > Because I also considered the scenario you depicted here, still got

Re: [gcj] Re: Doubt regarding logic for 2nd problem of CodeJAM 2019

Mine was to walk down the diagonal making sure that each time you stopped off the diagonal you were the opposite side of the diagonal from Angela or whatever the other walker was called. On Sun, 7 Apr 2019, 10:36 pm Ronan Burke, wrote: > My solution for this one was to just do the opposite of th

Re: [gcj] Timing

Wait it's this weekend?! On Thu, 4 Apr 2019, 5:12 pm Bartholomew Furrow, wrote: > You can look at the Code Jam homepage > , where there's a > countdown in the top-left corner, saying that it starts in about 1 day, 7 > hours. > You can also look

Re: [gcj] Qualification Round 2018 Trouble Sort RunTime Error

You seem to be assuming all the integers are single digits. On Wed, 20 Mar 2019, 5:29 pm Παυλος Τιριτιρης Here is my code in C++ i tried a lot and i didn't find anything , i would > appreciate if someone finds where the error is. > > > #pragma GCC optimize "O3,inline" > #include > #include > #i

Re: [gcj] Qualification Round 2018 Trouble Sort

I don't actually know what language this is. They all look the same to me now. But I think the things in your sequence ls are strings and you need to convert them to integers. On Mon, 18 Mar 2019, 8:00 pm Ho Wei Hong > > > Hi all, > > I am having some problems with my code. I think I have the ans

Re: [gcj] Explanation to a past contest problem

You are supposed to work out if you can take the collection of all of the names given and split them into two groups Group A and Group B so that each of the pairs listed has one name in Group A and one name in Group B. On Wed, 6 Mar 2019, 3:12 pm Harshad Hello, > I didn't understand what this pro

Re: [gcj] Runtime Error problem about input and output

jam to see whether you > ever used Java before. Apparently you used it for Round 1A's problem B in > 2008, and apparently not since then. I guess the dozens of languages you > used in between provide *some* excuse for not remembering. > > On Wed, Feb 13, 2019 at 9:29 AM Luke Pebody

Re: [gcj] Runtime Error problem about input and output

Guessing the error is in the out: you are adding a string to an integer. This works in JavaScript but not in most languages. Which language are you using? On Wed, 13 Feb 2019, 11:23 am Ayyuce Demirbas Hello, > > > I am trying to submit my solution but I get a runtime error. I think the > problem

Re: [gcj] Round1c Ant stack issue ?

1 2 3 1 2 3 4 is valid On Wed, 9 May 2018, 12:00 am Sergio Dos Santos, wrote: > Hi, > > I have one test case for which I don't understand the output of most of > the valid solutions. > > If I consider the following test case : > > 1 > 11 > 43 7 1 2 3 43 7 1 2 3 4 > > As far as I have understood

Re: [gcj] Mystery Square

As the only person who solved the large on that question, the analysis nails exactly what I did. The idea is that the first half or second half of a square is enough to determine it. There are 40 missing digits and at most 20 of them are in the first half or second half. 2^20 is a million* and so y

Re: [gcj] Re: practice mode + downgrading other contestants' code is live on our site!

Who me? I came 2404th in the Qualification Round. I found Problem C interesting. On Fri, 20 Apr 2018, 9:45 pm Bartholomew Furrow, wrote: > I've been waiting for this. Okay Luke, what's your rank in the rounds so > far? > > -- > You received this message because you are subscribed to the Google G

Re: [gcj] Practice mode coming soon!

[+1] On Thu, Apr 19, 2018 at 11:37 PM, Bartholomew Furrow wrote: > Woot woot! > > On Thu, Apr 19, 2018 at 11:58 AM 'Pablo Heiber' via Google Code Jam < > google-code@googlegroups.com> wrote: > >> >> >> >> >> >> *Hi Everyone,We announced last week that we'd be launching a one-week >> optional pra

Re: [gcj] Mystery Square

First part: (in decimal) what are the following squares? 522??? ??7609 On Thu, 19 Apr 2018, 3:37 am Serhat Giydiren, wrote: > Hi all. > > I am reviewing past problems. Is there anyone who has another analysis / > approach for the following problem. > > https://code.google.com/codejam/contest/11

Re: [gcj] Re: Finding another competitor on the score board?

I wholeheartedly agree with bringing back that feature. Otherwise if a contestant had written a solution in an outrageous choice of programming language, then written a python interpreter for that language, found it too slow and so written a C++ interpreter instead, what way would there be for that

Re: [gcj] Messages on the mailing list

But we can wish you luck. Good luck! Enjoy the questions and the challenges! On Fri, 6 Apr 2018, 9:34 pm Bartholomew Furrow, wrote: > It appears that the high volume of messages today is messages that people > sent last week. I'm assuming that they were caught in a moderation queue. > > I'm also

Re: [gcj] Your output should start with 'Case # 1

You need to input the output of your program, not the program itself. (for tests of old code jams - as I understand it, the opposite will be true in the new code jam) On Thu, 22 Mar 2018, 10:32 pm , wrote: > Hello > I am preparing for the contest by trying to correct the past subject. I > en

Re: [gcj] Google Code Jam 2018 registration is open

I think the change that will have the biggest effect on my later round strategy is that, if I understand correctly, we will not have access to the test data from the Small/Visible data sets when programming the Large/Hidden data sets. For many problems I would solve the Small by brute force and us

Re: [gcj] Google Code Jam 2018 registration is open

You can only use one of twelve different programming languages?!?!? This is the end of an error. On 7 Mar 2018 4:02 am, "Bartholomew Furrow" wrote: > OK, things seem to have changed a tiny bit > . > I've read through the FA

Re: [gcj] how much what advance topics should learn

For your other questions, start with https://code.google.com/codejam/resources/quickstart-guide On 2 Jan 2018 5:09 p.m., "Luke Pebody" wrote: > No AI is needed for the code jam. as far as I know (would be pleased to be > corrected), no AI has ever been used to solve a code jam p

Re: [gcj] how much what advance topics should learn

No AI is needed for the code jam. as far as I know (would be pleased to be corrected), no AI has ever been used to solve a code jam problem. Although if I recall correctly someone used Simulated Annealing to solve two different problems in one Code Jam Final. On 2 Jan 2018 5:07 p.m., "Gaming & Fun

Re: [gcj] about problem query of death Distributed GCJ 2017

t is 2 second. > > > Reynaldo Gil-Pons 于2017年6月4日周日 下午7:39写道： > 0.2 millisecons to read a single bit? They say 0.2 microseconds. I get WA when doing what I explained, in 1.7 seconds... > > > > On Friday, June 2, 2017 at 12:09:47 PM UTC-4, Luke Pebody wrote: > > >

Re: [gcj] about problem query of death Distributed GCJ 2017

I would think it can't work on the large case because it takes 0.2 milliseconds to read a single bit once and therefore 20 seconds to read all 100M bits once and 10 minutes to read them 30 times. On 2 Jun 2017 4:56 p.m., "Reynaldo Gil-Pons" wrote: > In the analisis they explain a solution for th

[gcj] IPSC 2017

Does anyone know if there will be an IPSC this year? It is the highlight of the programming contest year (No offence to GCJ and DCJ) -- 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

Re: [gcj] 1A Problem C. Play the Dragon (Practice Version)

I don't agree that you have to cure on the second move. Surely you can debuff and have 1 point left? On 21 Apr 2017 1:38 p.m., "sg" wrote: > Hi, > > Input case no. 15 in the small input of this problem is: > > 92 1 97 47 0 1 > > First Move: > Dragon performs Debuff > 92 1 97 46 0 1 > Knight repl

Re: [gcj] Round 1A - Alphabet Cake - (Edge Case)

All letters in the input data must be distinct. Your case has 2 Gs On 18 Apr 2017 2:39 p.m., "varun vats" wrote: > > In Question : Alphabet Cake, > The greedy Large approach: > > There is a simple non-recursive approach as well. First, within each row, > we can extend each existing letter into a

Re: [gcj] Problem D Fashion Show

Yes, but of any two models on a row or column, one must be a +. Since there are two on that row that are not a +, that condition is not satisfied On 12 Apr 2017 10:58 p.m., "newbie007" wrote: > https://code.google.com/codejam/contest/3264486/dashboard#s=p3 > [quote] > ... > x+o > .+. > > The mid

Re: [gcj] Qualification round points needed?

It is at the top of the scoreboard for the round and is 25 On 10 Apr 2017 4:09 a.m., "Stefan Pochmann" wrote: > The terms say "If you earn a minimum number of points during the > qualification round, which will be displayed on the Contest website, you > will advance to Round 1 of Code Jam." > >

Re: [gcj] How many points are needed to qualify?

https://code.google.com/codejam/contest/3264486/scoreboard?c=3264486 25 On 8 Apr 2017 2:18 p.m., "Joel Berghoff" wrote: > I can't find this info anywhere :( > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this g

Re: [gcj] In case of Ties...

In https://code.google.com.codejam/terms it says "we reserve the right to break ties when necessary based on finer time precision than is specified on the scoreboard." Sent from my iPad > On 5 Apr 2017, at 15:48, Paul Smith wrote: > > I think it's very unlikely that 2 competitors will finish

Re: [gcj] GOOGLE SPACES

Google spaces will be discontinued on April 17th. Sorry. Sent from my iPad > On 29 Mar 2017, at 18:29, Alcampo Torrejon > wrote: > > I love Google spaces. Where it is? We are Google spaces. The door of the > communication, innovation and thecreativity. > > -- > You received this message be

Re: [gcj] Query

Suppose the problem was: you will receive an input file starting with a number of cases, and then a number for each case, and you are to output in a sentence the square of each number. 1) Create a c file called squareNumbers.c #include int main(){ int numCases; int value; int square; sc

Re: [gcj] query

Can confirm. On Sat, Mar 25, 2017 at 4:23 PM, Bartholomew Furrow wrote: > You only end up trying 68 times if you try to solve your problems in > languages like LOLCODE <https://www.go-hero.net/jam/10/name/linguo>, > though. > > On Sat, Mar 25, 2017 at 6:48 AM Luke Pebody w

Re: [gcj] query

python a.py < a-small-attempt68.in > a.out On 25 Mar 2017 12:20 p.m., "arumugam gandhi" wrote: > how to save the result in a file after running my program on that input > file then submit the output file? > > -- > You received this message because you are subscribed to the Google Groups > "Googl

Re: [gcj] Re: Code Jam 2017 Registration Now Open

The new front page is alright. On 18 Mar 2017 10:04 a.m., "Felix Voituret" wrote: > The new UI is great ! Is there any change regarding of switching > ClientLogin authentification to OAuth ? > > Envoyé de mon iPhone > > Le 18 mars 2017 à 01:20, Bartholomew Furrow a écrit : > > Oh wow, you guys

Re: [gcj] codejam kick start problem

I think of it as a problem solving contest, and one of the key skills is knowing which tools to apply to which problems. That being said, I have never used a Cas to solve a code jam problem. On 10 Mar 2017 2:55 p.m., "Wing-chung Leung" wrote: I'm okay to solve some math problems in a coding cha

Re: [gcj] Code jam - can we use threads?

Yes. You are running on your own machine and can use any shortcuts or helpers you like as long as they are freely available. It will often be less helpful than you would hope. Many questions have only 1 or 2 extremely difficult test cases and the other threads will be twiddling their thumbs. On 6

Re: [gcj] Re: Round 3 analysis thread - crowd source attemp

Hope you feel fully recovered! On 29 Jun 2016 21:24, "'Ian Tullis' via Google Code Jam" < google-code@googlegroups.com> wrote: > Our analyses > for > Round 3 are up now. Apologies for the delay. Our goal has been to post th

Re: [gcj] Round 3 analysis thread - crowd source attemp

Here's a partly documented solution to Problem B: http://ideone.com/CjB58d Basically, if problem X is basic and has K problems (including itself) that depend on it, directly or indirectly, the K spots in which you do those problems are chosen uniformly at random from all subsets of size K. On Sat

Re: [gcj] No more Python @ DCJ?

DISREGARD On 20 May 2016 23:15, "Luke Pebody" wrote: > What about Pascal? > On 20 May 2016 21:46, "'Pablo Heiber' via Google Code Jam" < > google-code@googlegroups.com> wrote: > >> Hi, >> >> As explained in the distributed FAQ: &

Re: [gcj] No more Python @ DCJ?

What about Pascal? On 20 May 2016 21:46, "'Pablo Heiber' via Google Code Jam" < google-code@googlegroups.com> wrote: > Hi, > > As explained in the distributed FAQ: > https://code.google.com/codejam/distributed_faq.html#2 > > "In 2016, we will support C++ and Java. > > Python and Pascal were only p

Re: [gcj] Re: Swithing from python to c++ for competitive programming. Any tips?

Why do you want to switch? Python is great for competitive programming! Sent from my iPad > On 8 May 2016, at 16:27, 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 sw

Re: [gcj] Re: manual solving of Numbers (https://code.google.com/codejam/contest/32016/dashboard#s=p2)

Nothing good I hope. On 2 May 2016 21:16, "Anton Popov" wrote: > Spectacular! And thanks by the way! I learn a lot by reading your source > code to other problems > > On 2 May 2016 at 21:59, Luke Pebody wrote: > >> I did problem C-small of the qualification rou

Re: [gcj] Re: manual solving of Numbers (https://code.google.com/codejam/contest/32016/dashboard#s=p2)

I did problem C-small of the qualification round manually this year. https://www.go-hero.net/jam/16/name/linguo On Sun, May 1, 2016 at 10:10 AM, Anton Popov wrote: > And on top, you still have to provide the source code (which in this case > would be a text file with description of the manual a

Re: [gcj] T-shirt for top?

https://code.google.com/codejam/terms.html 6.1 *Code Jam T-Shirt*. You are eligible to receive *one* t-shirt if: 1. (A) you are one of the top-scoring 1000 contestants from Code Jam Round 2; or 2. (B) you are the winner of Code Jam 2015 and eligible to participate in the final round p

Re: [gcj] submit only algorithms

You also need to submit thenoutput from running your code on a downloaded input data set On 26 Mar 2016 11:24, "sanjay kumawat" wrote: > I am new to google jam. > so I asking that silly question that it is possible to submit only > algorithms as solution. > > -- > You received this message becaus

Re: [gcj] Program Error

Which problem is it supposed to be a solution to? Sent from my iPad > On 23 Mar 2016, at 13:10, Amir Mallick wrote: > > #include > > using namespace std; > > int main() > { int t; > cin>>t; > int out=0; > while(t--) > { > > int a[10]; > int h[15]={0}; > int c[15]={0}; >

Re: [gcj] Helpful info for 2016 Code Jam

Most people use C++ because: 1) it is faster for execution time 2) they do other programming contests and c++ is good to use there because of 1). However I feel the code jam questions are almost all designed so that the challenge is coming up with a good algorithm, but when you do that algorithm c

Re: [gcj] Re: Code Jam 2016 Registration Now Open

0 Mar 2016 06:30, "vivek dhiman" wrote: > As we are on this thread. Any pointers to good resources for learning C++? > > Thanks & regards > Vivek > > On Thu, Mar 10, 2016 at 6:58 AM, Luke Pebody wrote: > >> Porque no les dos? >> >> On 10 Mar 2016

Re: [gcj] Re: Code Jam 2016 Registration Now Open

Porque no les dos? > On 10 Mar 2016, at 04:10, Bartholomew Furrow wrote: > > Hahaha. By the way, would you say that I'm a student of parenting, or a > professional parent? I need to know for this registration form I'm filling > out... > >> On Wed, Mar 9, 2016 at 12:02 PM Hamza Mushaiti wrote

Re: [gcj] Re: Code Jam 2016 Registration Now Open

n Wed, Mar 9, 2016 at 9:00 PM, Luke Pebody wrote: > Sorry, I cannot agree with this claim. People can certainly do well with > just java. Or just python. Or just c++. Or just haskell. Possibly just vba, > but that's pushing things. > > On Wed, Mar 9, 2016 at 8:56 PM, Fa Bel

Re: [gcj] Re: Code Jam 2016 Registration Now Open

y the ride! Luke On Wed, Mar 9, 2016 at 9:00 PM, Luke Pebody wrote: > Sorry, I cannot agree with this claim. People can certainly do well with > just java. Or just python. Or just c++. Or just haskell. Possibly just vba, > but that's pushing things. > > On Wed, Mar 9,

Re: [gcj] Re: Code Jam 2016 Registration Now Open

Sorry, I cannot agree with this claim. People can certainly do well with just java. Or just python. Or just c++. Or just haskell. Possibly just vba, but that's pushing things. On Wed, Mar 9, 2016 at 8:56 PM, Fa Bel wrote: > Hamza, I think you should wait until next year, because you need more th

Re: [gcj] Please help in finding error. It works good still error is shown

I disagree with this diagnosis. I think it faults with the large data set and gets the answer right if you make your array big enough. A quick note: the 'break' breaks you out of the 'for (k = j + 1; k < p; k++)' loop, but not the 'for (j = 0; j < p - 1; j++)' loop. On Sat, Sep 5, 2015 at 7:47

Re: [gcj] Store Credits

It won't work for the large data set because you have only made an array of size 100 and you might need an array of size 2000. On Sat, Sep 5, 2015 at 7:30 AM, yatingarg12 wrote: > # include > using namespace std; > int main() > {int n,c,p,a[100],x,y; > cin>>n; > for(int i=0;i {cin>>c>>p; > for(

Re: [gcj] Re: Multiple Messages in Distributed Code Jam

Cool. This information will be useful, thankyou. Sent from my iPad > On 14 Jun 2015, at 13:34, Onufry Wojtaszczyk (Onufry) > wrote: > > W dniu piątek, 12 czerwca 2015 08:43:01 UTC+2 użytkownik Luke Pebody napisał: >> Suppose node 180 does PutInt(280, 1); Send(280); PutInt

Re: [gcj] Not sure if proposed solution for "Shhhhh" is possible with messaging system in use

You can specify -1 as the node to receive from, and you block until you receive from any node. On 13 Jun 2015 04:51, "Stanislav Zholnin" wrote: > Thank you for editorial! Previously there was usually no editorial for > practice rounds (if you look into 2008), so this is nice development. > > Refe

Re: [gcj] Not sure if proposed solution for "Shhhhh" is possible with messaging system in use

Sorry for the stupid question, but where is the editorial? On Sat, Jun 13, 2015 at 4:50 AM, Stanislav Zholnin < stanislav.zhol...@gmail.com> wrote: > Thank you for editorial! Previously there was usually no editorial for > practice rounds (if you look into 2008), so this is nice development. > >

[gcj] Multiple Messages in Distributed Code Jam

Suppose node 180 does PutInt(280, 1); Send(280); PutInt(280, 2); Send(280); and then, 6 minutes later, node 280 does Receive(180); int x = GetInt(180); Receive(180); int y = GetInt(180);. Which of these describes the values of x and y? 1) x=1 and y=2 (180 sent [1] and [2], 280 received both) 2)

Re: [gcj] Re: Messages in Polish in parunner.exe

To prawda, sens, co jest powiedziane, może być wyrażona przez moc potężna tłumaczyć Google'a On 11 Jun 2015 21:03, "evandrix" wrote: > On Wednesday, June 10, 2015 at 4:17:38 AM UTC+8, Stanislav Zholnin wrote: > > Hi, > > > > Is it intended behavior that parunner.exe at some point prints messages

Re: [gcj] dcj.sh for mac os x

ve just release a new version for Mac OS, please take a look and try > it: https://code.google.com/codejam/distributed_guide.html > > -- > Ahmed Aly > > On Wed, Jun 10, 2015 at 9:29 PM, Luke Pebody wrote: > >> Has anybody gotten dcj.sh to run on mac os x? Despite being o

Re: [gcj] a Linear Programming approach to problem B of round 2

Indeed I did. The linear programming library I used did not give accurate enough answers on the small data set to pass, so I solved the dual problem instead, which turned out to be quite easy. On Tue, Jun 9, 2015 at 9:50 PM, Edward Lockhart wrote: > Yes - see for example linguo's solution. > He

Re: [gcj] a Linear Programming approach to problem B of round 2

Check out my (linguo, 36th) solution to C-Large. Python solution using linear programming tool. Make that runnable on your machine and you could do the same. On 10 Jun 2015 09:38, "bigOnion" wrote: > On Wednesday, June 10, 2015 at 10:16:19 AM UTC+3, M.H. wrote: > > >> I know that obviously coding

[gcj] dcj.sh for mac os x

Has anybody gotten dcj.sh to run on mac os x? Despite being ok at algorithms, I am terrible at computers. I figured that "mac os x = linux" as people who are good at computers tell me, so I downloaded the linux version, but I am getting the message "ld: library not found for -lcrt0.o". Thanks all,

[gcj] Alternate solution for 2015 Qualification Round problem 'Dijkstra'

Thinking about regular expressions this weekend (and how they are equivalent to discrete finite-state automatons), I realised that Problem C from this year's Qualification Round could be solved quite cleanly by a regular expression. I compiled a 653,804 character regex that would work, but in order

[gcj] Alternate solution to Qualification Round problem 'Dijkstra'

Thinking about regular expressions this weekend (and how they are equivalent to discrete finite-state automatons), I realised that Problem C from this year's Qualification Round could be solved quite cleanly by a regular expression. I compiled a 653,804 character regex that would work, but in order

Re: [gcj] Any non-brute force solution for Typewriter monkey (Round 1C 2015 B)?

Dang it, you had this brainwave 3 hours before me. On 12 May 2015 04:09, "Joseph DeVincentis" wrote: > Today while I was trying to explain this problem to a friend, I realized > there was a simpler solution. No looping through letters typed or tracking > states is necessary. To find the expected

Re: [gcj] Just found out there's the solution / analysis for each problems in the code jam

There's a link to all of the old problems, submissions and analyses at https://code.google.com/codejam/contests.html On Sun, May 10, 2015 at 6:20 PM, Vincent Le Quang wrote: > I'm a bit noob at this code jam thingy. I just realized there's analysis > and solution for each of the past rounds! >

Re: [gcj] Re: Python Fast Enough For CodeJam?

There was no problem D in 2015 Round 1A. On Sun, Apr 19, 2015 at 5:08 AM, ll wrote: > As others have stated, Python is definitely fast enough. The problems are > designed specifically so that there is leeway for slower languages. > > That being sai

Re: [gcj] Can we do many Round 1?

Yes. On Fri, Apr 17, 2015 at 6:08 PM, Vincent Le Quang wrote: > I think in previous Google Code Jams, you could try the first Round 1, > then if you failed, you could do the second Round 1 and the third. > > I just want to confirm, is it still the case? If I fail the first Round 1, > can I try i

Re: [gcj] Probably found a bug in google jam 2015

Use 3 special seconds to split each pile of pancakes into piles of 3 and then 3 seconds for everyone to eat their 3 pancakes. On 12 Apr 2015 23:32, "Michael Frysztacki" wrote: > Hi all, > I think I found a bug in the google jam 2015 evaluation system, it regards > task "B" - Pancakes House. I hav

Re: [gcj] Please help me with the Small B. Getting wrong.

1) If you have 6 stacks of size 4, then you are best off just letting everyone eat 2) If you have a stack of size 9, the best thing to do is to have one special minute where you give 3 to some other hungry customer, and then another special minute where you do the same. On Sun, Apr 12, 2015 at 9:1

Re: [gcj] Can't find problem in Magic Trick Program

Quick code review: 1. Your use of .replace("\n", "") is to get rid of an ending newline. It is more pythonic to use .strip() 2. Suggest defining functions readInt() for int(s_input.readline()) and readWords() for s_input.readline().split(). Note that if you do not specify what you are splitting b

Re: [gcj] Re: Please help me with solution submission...

Also, if you have saved a python script called myScript.py and downloaded an input file called myData.in then you can run from the command line myScript.py < myData.in > myOutput.out On Fri, Apr 3, 2015 at 7:21 AM, ambreen haleem wrote: > I don't write in python much, but there are online tutor

Re: [gcj] C++11

You can use any language you like, as long as it has a free compiler and interpreter. C++11 does, so it is perfectly legal. On Wed, Apr 1, 2015 at 5:48 AM, ambreen haleem wrote: > Can we use C++11 standard ? > > -- > You received this message because you are subscribed to the Google Groups > "Go

Re: [gcj] Square Fields - Google Code Jam

The crux of this solution is in the recursive function Rec. I have rewritten this with easier to read variable names and with commenting at http://ideone.com/TNrdFO Essentially it recursively goes through all ways of separating these into at most k sets, finds the minimum square size needed for e

Re: [gcj] how to approach this Q?

I have programmed the Binary Indexed Tree approach in C# here: http://ideone.com/Ammsll On Wed, Jan 28, 2015 at 3:42 AM, Luke Pebody wrote: > Having verified that the contest this puzzle was in is no longer running: > > If the upper bound on the number of students is 10,000 and the up

Re: [gcj] Minesweeper - trying the "Backtracking" approach discussed in "Contest Analysis"

In the contest analysis it says: With this insight, we can implement a simpler backtracking algorithm that places mines row by row from top to bottom with non-increasing number of mines as we proceed to fill in the next row and prune if the configuration for the current row is invalid (it can be c

Re: [gcj] how to approach this Q?

Having verified that the contest this puzzle was in is no longer running: If the upper bound on the number of students is 10,000 and the upper bound on the number of chocolates is 105 then the total number of deliveries of chocolates to students is at most 1,050,000. As such a brute force method w

Re: [gcj] Compile Error

This seems to compile fine. Are you entering it as a different language than C++? On Fri, Nov 7, 2014 at 5:15 PM, Xiongqi ZHANG wrote: > Why would you need to capture runtime exception? > > 2014-11-07 21:43 GMT+08:00 Hussam Cheema : > >> Guys UVA identify Compile error in this program plss help

Re: [gcj] Code Jam 2015 schedule

Seems unlikely, because there is no google office in Douala. On Sat, Oct 11, 2014 at 2:41 PM, kwaye kant wrote: > @Luke in Douala/Cameroon , central Africa. Why not? > > On Oct 10, 2014 8:39 PM, "Luke Pebody" wrote: > >> What city is the finals in? >> &g

Re: [gcj] Code Jam 2015 schedule

What city is the finals in? ... are the finals in? Luke On Fri, Oct 10, 2014 at 8:17 PM, 'Igor Naverniouk' via Google Code Jam < google-code@googlegroups.com> wrote: > Hi All, > > We're close to announcing the 2015 Code Jam schedule! But we want your > feedback first. Here is the proposed sched

Re: [gcj] R1A 2014 'Full Binary Tree' , is there any pre defined algorithm to find if a graph is a full b tree

https://code.google.com/codejam/contest/2984486/dashboard#s=a&a=1 On Thu, Aug 7, 2014 at 8:28 PM, Anubhav Sethi wrote: > If no then how to approach with this probem, pls help > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsub

Re: [gcj] Re: Round 3, Problem A. Binary search really necessary for O(n) solution?

Yes, this solution works. Sadly, I came up with this solution after the contest. The solution that I crafted during the contest was the binary-search method, but I had a little bug in deciding whether a given value would not work. My method worked for all of the examples in the small test, and all

Re: [gcj] Re: Round 3, Problem A. Binary search really necessary for O(n) solution?

I guess you'd probably want "res = 1 - (solveig + 0.0) / sum(ts)" as the penultimate line. Sent from my iPad > On 22 Jun 2014, at 09:48, evandrix wrote: > > Hi, > > I tried to run your solution through (using PyPy 2.3.1) A-large-practice, and > received the WA judgment on your output using t

Re: [gcj] Don't Break the Nile

I didn't work it out during the round, but my solution involves using the Maximum Flow - Minimum Cut theorem to say that the maximum flow is equal to the number of vertices you need to remove for no flow to be possible. Now any set of vertices that cut off all flow will start at the left edge, the

  1   2   3   4   5   >