|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re: Stamp puzzle solutionby drpaz (Acolyte) |
| on Jun 07, 2019 at 17:22 UTC ( #11101106=note: print w/replies, xml ) | Need Help?? |
|
I should clarify this solution prints achievable amounts, with the breakdown of how it's achievable, one per line, and non-achievable numbers as !number, one per line, so to answer the original question:
perl elbonian.pl | grep ^! | head -1
In Section
Obfuscated Code
|
|
||||||||||||||||||||||