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

by LanX (Saint)

on Apr 15, 2019 at 19:24 UTC ( [id://1232599]=note: print w/replies, xml )

Need Help??

"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}

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

Replies are listed 'Best First'.
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
The input set could be infinite, only the test cases are limited. Testing all 20 x 20 grids doesn't mean you know "ALL IMPOSSIBLE" input. This would imply a proof, hence my question. Clearer now? :) Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]
Re^7: Google Code Jam 2019 Round 1A Problem 1: Pylons by tybalt89 (Monsignor) on Apr 15, 2019 at 20:22 UTC
I should have said "All IMPOSSIBLEs within the stated specifications given for this problem."	[reply]

In Section Meditations

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://1232599]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others drinking their drinks and smoking their pipes about the Monastery: (2)

As of 2024-04-24 22:58 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found