Re^2: Google Code Jam 2019 Round 1A Problem 1: Pylons

> ( slight cheat: All IMPOSSIBLEs are hard coded (HINT: there are very few) :)

Lemme guess, the remains were proven to be POSSIBLES by brute-force searching (N.B. only inside the max-boundaries) and not by applying mathematical reasoning?

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

Comment on Re^2: Google Code Jam 2019 Round 1A Problem 1: Pylons

Replies are listed 'Best First'.
Re^3: Google Code Jam 2019 Round 1A Problem 1: Pylons by tybalt89 (Monsignor) on Apr 15, 2019 at 17:43 UTC
It is a "code jam" and not a "math jam" :)	[reply]
Re^4: Google Code Jam 2019 Round 1A Problem 1: Pylons by LanX (Saint) on Apr 15, 2019 at 19:24 UTC
"JAM" it certainly is. ;) But my point is a bit different, I once participated at a golfing competition where the winner had impossibly short code. Turned out he just hardcoded the desired result into a print. Precomputing all results for a finite input set indeed looks like ... jam. Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]
Re^5: Google Code Jam 2019 Round 1A Problem 1: Pylons by tybalt89 (Monsignor) on Apr 15, 2019 at 19:44 UTC
I guess I didn't understand ;( However, for this problem the code had to produce a complete valid path for each POSSIBLE solution, and those paths were not hard coded.	[reply]
Re^6: Google Code Jam 2019 Round 1A Problem 1: Pylons by LanX (Saint) on Apr 15, 2019 at 20:03 UTC
Re^7: Google Code Jam 2019 Round 1A Problem 1: Pylons by tybalt89 (Monsignor) on Apr 15, 2019 at 20:22 UTC


Perl: the Markov chain saw
	PerlMonks