kolmogorov-复杂性挑战的基本思想是以最短的代码打印一个集输出(尽管这个意思现在已经改变了)。从博罗米氏环到葛底斯堡演说,我们都有过很多。
##Your任务
这个问题类似,只是需要打印一个特殊的文本--这个问题的文本。具体来说,就是我现在输入的标记代码。
为了防止问题中的无限递归,您必须打印的确切文本可以找到这里。
##Clarifications
发布于 2015-09-02 01:17:49
#!/bin/sh
base64 -d <<M|zcat
H4sIAKBL5lUAA5WTQW/bMAyF7/kVHHppgyhOmgRtett2GHbYZQswDEEPtE3bQmzRlegk/vejZLTY
etoAIw4s6fHxe9ShIcgx2AJsSQhcAcJRsH46cdtxzZ7PpuCub+lqZXyGosG2JVcT2ADC0HvrRM8E
EuBB+kHAOhBVDQ17oSBQcElwKw0PdaMrKNAROutqaDBEQVUrwfHlbgk/ST+e408JHboxGlKxbgGV
5w6On9jrW4/DdxUIz7eNSP+UZbFGzW21DILFia6T6lKdZy+DmrDsQrbbbNcPGYbCWpO/Chkfhe5i
L8eD2v5CImPIB1/Dx7L0FP6zyHq32e+yhi/Goyu5MzYY7cDUb7oGJ9275Wx2c/OLBw8HDKfZ7NAo
01elyDfYzrboF6C1qJcJnhXw9DJYlZjoR5Ipt9BTYbEFoauASSGkv4nhH9JL+BF3VrbQLMdF2ngm
P8I39KeSL26KLFX7CtiBjH0s4m3dSAxKjR9i9HSmGL56dZV1VkidFYMPyf40Ba81pyp0xUImUyMP
U9RvQ1SoUE5Q8eBKODbk6V/IqwkbJvLVw2ZNuDGr/W5ltvlqY5D2O3O/rfBxfY97vH/MzpYuJijz
gib+nxVwQpHim80MaCKAnrRR7a1t+aLTqSaHQBAnUs2Td4p5UgnQ2hOl7rQJXSFZqkjKMs5XmDjG
9X7wPavK+zxi1LGYFon0W9bh/3tDIqbjBD16FbCygDzdtCCEyV0Q9nEhco9oe8+1x+7Nij7pWkeS
JqJ8XmgD7y6pnp3P81E/zOdwUfUPvwFrjlp7HwQAAA==
M所有的代码都在第二行。
base64 -d从stdin解码base64数据<<M使用仅包含M的第一行文件结束从脚本本身引导stdin。|是一个管道,将输出定向到zcat是一个从stdin读取的gzip解压缩器。可能会通过从数据中删除行中断并使用echo代替og heardoc来存储它,从而获得更多的金牌。
我觉得我错过了一些重要的东西..。
发布于 2015-09-02 01:20:49
非常天真的解决方案。我以后可能会想出更好的办法。
<?=gzinflate(base64_decode("lZNBb9swDIXv+RUcemmDKE6aBG1623YYdthlCzAMQQ+0TdtCbNGV6CT+96NktNh62gAjDizp8fF71KEhyDHYAmxJCFwBwlGwfjpx23HNns+m4K5v6WplfIaiwbYlVxPYAMLQe+tEzwQS4EH6QcA6EFUNDXuhIFBwSXArDQ91oyso0BE662poMERBVSvB8eVuCT9JP57jTwkdujEaUrFuAZXnDo6f2Otbj8N3FQjPt41I/5RlsUbNbbUMgsWJrpPqUp1nL4OasOxCttts1w8ZhsJak78KGR+F7mIvx4Pa/kIiY8gHX8PHsvQU/rPIerfZ77KGL8ajK7kzNhjtwNRvugYn3bvlbHZz84sHDwcMp9ns0CjTV6XIN9jOtugXoLWolwmeFfD0MliVmOhHkim30FNhsQWhq4BJIaS/ieEf0kv4EXdWttAsx0XaeCY/wjf0p5IvboosVfsK2IGMfSzibd1IDEqNH2L0dKYYvnp1lXVWSJ0Vgw/J/jQFrzWnKnTFQiZTIw9T1G9DVKhQTlDx4Eo4NuTpX8irCRsm8tXDZk24Mav9bmW2+WpjkPY7c7+t8HF9j3u8f8zOli4mKPOCJv6fFXBCkeKbzQxoIoCetFHtrW35otOpJodAECdSzZN3inlSCdDaE6XutAldIVmqSMoyzleYOMb1fvA9q8r7PGLUsZgWifRb1uH/e0MipuMEPXoVsLKAPN20IITJXRD2cSFyj2h7z7XH7s2KPulaR5ImonxeaAPvLqmenc/zUT/M53BR9Q+/AQ=="));发布于 2016-12-28 21:19:48
通过使用部分匹配预测压缩,这个方法比@Dennis快9个字节,它是由ppmd包实现的(可在官方Debian/Ubuntu存储库中获得)。
7461696c202d322024303e450a70706d642064204520313e262d0a6d3420
440a8fafac84a4810000f49f01005c1764584454163b8b4ebdd8f8e5852e
8649a4a01a7674929af8d6cd1d71d0758fed9551a4097e7bb3c21be619a9
ec5d7ea12677f8352b75824dc025a6c1f0b5ca6671431d03ba38e91326eb
8ea9e13a57a9607afd0ae43c8ae548ee3880197e6df9f90b4d6b45baa46b
159a15cd2993dc3f3a50d46226e301b7009174d32328bee2a7c9245a6861
779227a80ca5a016af3f08597440c86db41769b2b2b41646440eda804f9c
3b2aa70530f3080bec7acd58674a3d3b2f78f1c6674d938e415b3d07ab1e
3431a2e3165013b8251d1641f8d94be72b33aecd638d4332faa99662d848
cd5564e305b13f6ba0ccd2b105a0771ab454c417d2ebb9095291e768edde
acec556546dcf60c2cc0af962f96bb7b92d98f465bb799cd92b1b0a49a03
3261943b57a194110556ee4d39226ddfc7483ac83c6a840ba93d41ab64cf
926bbfd0423a43f7c75d73ac55d653e7de9c2d6c9508f6d371870041b133
91da72facf5b83edaf665607277384f903c1475b46e77ee58be32c6bfd5e
0eff7b206eb69b149b6649fd2f5fd933e7f8e2c61179f633551369077edb
c3de193a36f439718d0e249c04c99a88dc45ed7f4b1a8af2684d123397d9
efbca4ce93d202c7ef1f3d895fd56b655b2e34d9da1b301091e2d34e4272
342d5ea16b0973cf83dfb702009437de36f5f6292ec02aab23c3b27bb6ea
dfc40c378f61236db04dda644577114b8340ff93b65928041d8fa801f03c
abe0a89e552dc56842c5782a83992efe7200在运行此程序之前,请注意预先安装ppmd和m4包(如果没有安装)。
#Decode into "C"
xxd -p -r <<EOF>C
7461696c202d322024303e450a70706d642064204520313e262d0a6d3420
440a8fafac84a4810000f49f01005c1764584454163b8b4ebdd8f8e5852e
8649a4a01a7674929af8d6cd1d71d0758fed9551a4097e7bb3c21be619a9
ec5d7ea12677f8352b75824dc025a6c1f0b5ca6671431d03ba38e91326eb
8ea9e13a57a9607afd0ae43c8ae548ee3880197e6df9f90b4d6b45baa46b
159a15cd2993dc3f3a50d46226e301b7009174d32328bee2a7c9245a6861
779227a80ca5a016af3f08597440c86db41769b2b2b41646440eda804f9c
3b2aa70530f3080bec7acd58674a3d3b2f78f1c6674d938e415b3d07ab1e
3431a2e3165013b8251d1641f8d94be72b33aecd638d4332faa99662d848
cd5564e305b13f6ba0ccd2b105a0771ab454c417d2ebb9095291e768edde
acec556546dcf60c2cc0af962f96bb7b92d98f465bb799cd92b1b0a49a03
3261943b57a194110556ee4d39226ddfc7483ac83c6a840ba93d41ab64cf
926bbfd0423a43f7c75d73ac55d653e7de9c2d6c9508f6d371870041b133
91da72facf5b83edaf665607277384f903c1475b46e77ee58be32c6bfd5e
0eff7b206eb69b149b6649fd2f5fd933e7f8e2c61179f633551369077edb
c3de193a36f439718d0e249c04c99a88dc45ed7f4b1a8af2684d123397d9
efbca4ce93d202c7ef1f3d895fd56b655b2e34d9da1b301091e2d34e4272
342d5ea16b0973cf83dfb702009437de36f5f6292ec02aab23c3b27bb6ea
dfc40c378f61236db04dda644577114b8340ff93b65928041d8fa801f03c
abe0a89e552dc56842c5782a83992efe7200
EOF
#Run
bash C 2>/dev/null
#Cleanup
rm -f C Dhttps://codegolf.stackexchange.com/questions/55857
复制相似问题