Replace collecting then computing by reduce.

This is a bad idea; it's actually slower

2022/Cargo.toml

@@ -8,7 +8,6 @@ edition = "2021"
 [dependencies]
 anyhow = "1.0.66"
 clap = { version = "4.0.19", features = ["derive"] }
-itertools = "0.10.5"
 nom = "7.1.1"
 
 [dev-dependencies]

2022/benches/days.rs

@@ -8,7 +8,7 @@ use criterion::BenchmarkId;
 use criterion::Criterion;
 
 /// Number of days we have an implementation to benchmark
-const DAYS_IMPLEMENTED: u8 = 6;
+const DAYS_IMPLEMENTED: u8 = 2;
 
 fn read_input(day: u8) -> Vec<u8> {
     let input_path = format!("inputs/{:02}.txt", day);

2022/inputs/03.txt

@@ -1,300 +0,0 @@
-NJvhJcQWTJWTNTFFMTqqGqfTmB
-VwVzPldRZVLVRmfsvfjvqfmm
-ZDPDHZHVcvDhbvnv
-FHHwHBzzVCWWmmCzCPrVmgBwbLTtRFFbbbttRGRLjTcLpbbT
-vhZZvdsNSdSMdNvjncppCLcLnGnj
-CDZZsNZMZqdNSdlNZCqrzPHDzgrgzwVVWwmwwm
-ndlndntsFJntFvccLjjLrjBShcBBfc
-GpCGHzVwmmzqQWSSSfWHBhQL
-mpCMGGCZVzVwGGVwmJsZnFtZnTSTJtdsvl
-nCnPDGmDNmVCsVQDmGSWqvzchWSjjcWGqS
-gTnBRLpfTRnrTdZgdLfRdrThvqcvWWhFFWvcFSSgjqqzjv
-pfZfTMwrbLTTfsbmQtlVtHHnbs
-wNdSdsbTvTZMTvTv
-rrdRWdWQhFVdHWBGWQmmmnnMvCfmnhvmCmtZ
-rJrVDRWpGddpbSlNSlspPP
-chTNrthMMwWMTjfsmRzZszJpwm
-BLnFFCngbcBnbbldDlpRjGpmsCzGsGsRGmmG
-dqvnvlgbqtcPPMhH
-QcLNqZbCzJDQBJJRpwzRpdnRldgnpf
-GmmmvVGsHrWffrlwdCWd
-CMsFVVFjCmFStGQbbLZNBbJBcTjc
-LQVggbQvcLbQLHgvVLhWGGsChssrMWfzGccc
-qDnRTTRqJttPfWMChJhGslWlzh
-qRTRwPBTBtRZdnjnqqqnQVbjbNLFbbfLgVmgHLQm
-cZbzwCwZPlJcMLrNSNfHWNBBNZ
-vsQsDCqtsDhmtjVrBNWNjBHrhr
-TtDTGnvTlgbbRCGg
-BgBlplHlsgNNsJlVpBtPwJhMPRRQSSttRtSP
-bvhTnmdFTzddStwStQRddt
-ZnZDLvnvqZzbbhFzzmTbnFsVjVlNgsCCNVsVLpNWVgsB
-TdptqrrcVGhhzFtw
-DRnSfwJlDmmDDVGv
-RCSQNSCQZndwbcMqQrBB
-wvRlrlwVwwqzgbZRdCJBWfmdzCWfBdhf
-cFcsQpNtLLsGTtNGpMdPmDdPBmmBvJPWvDtC
-TpjssTFFvLLLcFFQpwbwwHngjHRrZRqZVH
-mqqddrPPcPmqPDlrQnjTrbvMvbHzzsjjpTvz
-gtBWgGgVhLGWHzMDztzstDHj
-hfWRhBBNBGgLNQDPwdNPcPdw
-LhQzdhhbTzpMhddhhhTzhnZcBFllHZFtrrHZHMHFjlHr
-mwwssqDvjptrvplr
-NCSgVDPDwmDgVJVpLfTznQJdhfLhnhQQ
-GzjzDhjhhZzcrRgQCBjBPBBjQCgT
-vHHHmntsbSgLwbsSmNHbwNbvpqPCBVppCpFTpTPTBtqWBCqV
-NJbwNSwdndvmvwhGhgzcfMcDJfgJ
-GncgDvvcMGnttjDvrgRRFSZZLZFWdJFJwGQwZBWZ
-bPqpChPfsshfZZBdZdLTFZ
-lNqqsClmbsNlPbHqPsmblmsrHdvdMngcVrjggvrvggRDcn
-bDvtgVVVpMQvjQWmQL
-rwTflmlfZJBBdQWQWjQqdM
-HsJJmZZwscHrwTrcRbzpcbPgtCSbgz
-CsCsRvshMjpbqCqf
-ncblgDBgtDmmmTlBgwlgbHHqMFHLqPDMHPHHpqWfFM
-TcBctSmTZTtSTzsZvsvJZRsGVb
-znznvngttwltzlLwhtThHbqHPvNbNHSSHmmNWHjP
-FBcLrRMFQpPqpPSpqHHW
-fRQMJZJfrcMcMVrQJJftnwCzVCltgTnstTVnVL
-MfLlRfCMrLzRlQgwNqQFcsGd
-jtTjjBTvbdqcGjqFcj
-vvShDSBDppzhCmzq
-plWMptTvfrnncvcRfwqzqLGhzhzThNzNNJqD
-jSdSHFPQQbdPCQCssjSbBmhJGNZZNGNqqJNBlJqqLh
-VCCCVCQgjdddjCgljCjbbwgRRttgrpftfWrgvpwpnf
-MWlbBcPjjvvjPWWMPqgRQZfJZDGGbRZJffQQwh
-HrHrnncHpzrJQJfVDQVR
-zzsSTtSTLzsspSdtTmHHmpmtFgqcgPlgFqWBqqqBMdWWvFlg
-nSqBbJbqlnBBClVZcMgZVgcP
-FQwrwHrRwWWFBRPNgNgcCGZZZC
-rWFWFTwpwwWzHrnDbfJDLDbBBbbz
-BMmNtLMMtFCNFNMvvLmcndpgcdgppPrgrGPPrgJD
-WVWWhbTtVnGpjrrPhr
-HWssSTHWfRHRsQQFLvfvFFCLCNMNlt
-sTmDsQffVrrLCjTFltTFWL
-BnwwQBJbJndMMRzMwCLlWlLWWCWLLtRlWF
-cqqBMcMqwnznMGzcvDmQhrvssHmPDVssrP
-pQGQGJDDrDVJbbfVzvvgPcCZwhZhncscZWWc
-SqMMlBBljMmRlchhPTqThCZnPs
-FMjMBmjRNFHQJJpHVhVDhG
-tHNNdBdNtBBBMgsMpsZm
-wVPzVvbwqzhrVqvjqzzsZpDsZDsZmsCPCgZgCM
-bVbvLThvvbrWqHmmnJLdHdJQLn
-PzTspPZpdLLDZTplPLpPDpvbfhnqNvqzfvNMzQQfNwnQ
-GWRHmjmFWMMSnhbhHw
-JWWcmtBrBtWBFWGJpsgTgldhLVLpJl
-DwLMDzLMhvMcwvgdVqWWlCVgvlqF
-TTSBBRpbStHZVgjWFldjRVlV
-SnbTBdJBmnpQzMPDMcMznr
-nNlMNBPPNtJQnbZhZsgSbh
-czzCjcwTdvSbgQNcgNQq
-VTdNdGDTzDTdlFFPtBrtLtDr
-FMbbfMlzvFsmgVZmmg
-SrNTHGmdSQDqLhtQhhgggs
-dRDTSDPPcHRdHGDHlwJBbmwljmMcfjbW
-sQgWLtqLtWhdqlpNZRpG
-blTHTjlvTCJnJvRZdGGhHHGZhFGV
-CCDlJclnCmbrmBMgcwcLWtcBsB
-vqPWWvqwwCFvFZfZPRFRrcGQrQwsDrNcrwnbDNcQ
-LVgJLSBBVtzTLzBMmTMJmLnnDNQcrsGbsQbNbrbDjs
-zggVSmmhVdfqFhvHWG
-WwdndGGmmmLwwwmRwWSncLRnZqZqhqZthBtqtBqZBgtdtvMH
-FfHHzlQQDsFzzrNsVTfttZvTvttTqqtbqb
-lQjFDNQFPjCsVCCDjGCwwSGGnccwcHppGp
-mrjggcFsFMjdjZRpSZpn
-NCqfLCFNbQPzPPlPzNfSRTRZdSdWWwndpqRSSd
-vDvzzbPQFNCFtllLLNMBhMcDHGBGMggMmcBc
-jhjlBvvnjbtDNPjtSjBDBbDNgHggrQrhghRQrqRrZcRwwqVg
-pLdTMsWdLLmpMdqZZdPdVqZgHPwH
-WLTCGmMLfPSlbGjlnnJD
-gtbwhgHbHgqqbgQthgQLtZZCRjMcjjnRnrRNJmMRJrNhRc
-bGWVTTvDvfpVFFBpvvVTdRDMJcrccCrJnMRnNnNCcc
-FVWTBsdvdTzTBFWssVQtLgSQtHqqPzPbqHbw
-dlzrPTSSjSrllzWhsvVmVtTRTWtf
-bJMpLGcqGhNbJQttVQmmvRWWsp
-qLbMwqqbGHFGzrlZrjhPHCrj
-rNrrffVlqqrfLlPpltcBBTTGRzzZRPRsBTcJ
-msbsmWSsMmQwjdMbWMhMhQmcRZRzGjTBGTBcBJBjCHJGcC
-FwWbvdhbmrsFrfrgsN
-rHjrQHdhdQrvSddcHWLssBSVVpBSWWWWWf
-JNfTGtqDwVWBMBMpwM
-qlltZgfJFvcRgcRjvc
-CqfcwfDqwwmRnnqmRdNRBTRTRrdGdNpTvF
-WVbzsZszBbrsvpdMpdQM
-tJhbVZHWLLHDgnSwnSSgHB
-TZCqqlTsqpZVVsZQJSBSLpLmppnJzmFz
-brSgNtGjjRjRRjDddDtrRJcJJbJmmwcmBmnPcJFwFB
-jgdRtMjNNjfqlMvShvSZSZ
-dJTdqCwMNCgqTQllGBdlGBmmmZ
-fcVfVcnbVfrwDLWVfncZBQPlBHRGljLZQjHGQl
-brwnnfSFDvfzCTqFzgMJTh
-njnsPBjjsrrnGLnbTTjGvcldQPCMllNzMvRQPCdd
-ggZgfZtmZVpqZqZWDgFmgqfCcQRcRcWhQcccQddMcvRQdQ
-tfqgggVgHpDwDtfwbGLJRjbLjsrLTj
-JmrfrmTlDWTfgQCdHCdpqBvQdD
-jsZtVzNsSNVQQHnBlVQR
-PljljFjPljSsLPtFLTTgTcFrrfMJmrrmrr
-hmGcmmndhmGnfmtGnDzFLwrFJQsQFzNFrNJG
-ZSqPlSWcWlbgqWVTVWRVZPrjQqjzjFNJzLsNJsLJNqNL
-RHcWTZbSMMMPgZcWgSWPPbVMDnBffmtdpDBddfnnvmCdfC
-vSJvsbFfJfvqCsTHJswssJnLTZjjhzrrzLrzLMrzhdjM
-pBNQDPcpmWDcBNgMMnZPVjdddnndhH
-QWlDgmpmgDBlGRgDDgffSqwSwGCwHfvqwSFJ
-jvlgvMJclPdGdtdcjMVmMHbFHFVHWHbZHZ
-CwhLzLhzQpnqfpfqDVHCHbsbDFZDmHmj
-LnBzfQjSzQrPvJvdSSrr
-wpcvcsqclDCnVCVvWfnZ
-BLRMRtbnbbBLNCjNCjVVZhbC
-rFgMPSRnrRpmqpJwqFDs
-LZQNQbMrZppLNLQplvlGLNvVmmmfjbwVCfjbwJwCmBCwfj
-ShTPRFtTHZPCsnwswsFwCF
-WtHRPdThSqZTRtDqtdRWTdpGDLLzrNczvzMGLlQLGDDM
-hdcffBvldjhCMljqPwWwWNwWdwqHZr
-LtQmbQRVsZQZMZPQSN
-tmMRsJMpDhjJzJhv
-wNQCMFCDQDBmrHmmRWrrHN
-SShLnfqpcqpSZSfrzJvRVrvfrrJH
-cRpqdGclpScltTQQtsFQMQsTCT
-NCjggZmgfBgnBmgWbcwcTFctcWWfvb
-HsDGthRGrtppSQpbFFJTVcJdFbTRvd
-rPDGhDDrSzZLtzBLZMCB
-RsBBMBsCBlFFCgRsBJzlMjMPNSdPhSrSrzLbmSDrDNmDSd
-pZHZZJpGHHHpTTHvTncZqVLdqLbhLrDLdhrSLLbLDDdD
-tGtwnJccvCtCffMBgt
-wbddvVjfwPhbjjbDbbvbjvTNCNmfHZfpCZRJNzCmJmnJNC
-BslcLtclZWsZJWNrRRNRpRmR
-BSLBlScGtFMcssMBBFGLlQZTDZQjPddVwwbTdvvdhTZb
-NSZHzmLZBnzHmLLzLSntDttDDtddhDtttDWW
-QgfjsrrvNNJwtMddcvcvtq
-jrfgfQpQrTTVLSNBClFV
-GQWcWWPPQRcrJQNDdRcDmmLCFSnqNSmqhCNvFnql
-zHfwjzpMjwZmCLqvvnlljC
-ZgtVZBtHHZtgQGgPrbPRJdPv
-TWdWpJTJTdgLWfWLlLFLrfrgBGsNqhGslBGHqSNqqBNshnws
-ZpQmjzbZZCjZCCCPZtttRCCwsBnHNssBHbShsshHqsGBqN
-RDRRPpPCzmZCtRpVVJFrfTfWFLLJggJrDv
-pDDFlglsvFMgntlTMMqNffmTdfddRM
-jhGJLVCHQpHGQCCzLjWdTTdZZdNdcRWNccWfNN
-jQjSGjrjCQLhzVSLSCSHGDpngbrnDFtFBwBglBnBvg
-wsLzstsgszcpcGLHGpcgcghlDBvQvjQvbFbQCbJBtCCJJv
-mnSqRSSqSRThWRnmWWRSJDFTFCFCblbBCFQFCjFj
-rZRRWqSSdZZfMVnZLspPsMgHpzMhHGPg
-mwHrCLSWWwrsHCHDDsVrsmhfFZFnSSBlFlgZbbgBglbggj
-GJdpcRtGJvNRdcPtdpJJdbQZfjfQBlnQBjnBtbfFnB
-qcPpqqzFzJqvPVCCmWrVwhrWrz
-jjMbvbhDvnRjNRGMmjbMZftSSwwwthJSffStctcwqd
-lTQrVlpCVvCcfdcSJqLVcw
-srHFWCHrFlrHlrsBsprljjRmDZZnmbDngNBgbNZv
-MgTlQJlTQJZWpgLrRssrVqqqpRts
-bBNbbzSSjMBPjzhMjsPtRVVRVPRqLttGGs
-SjHBbfjNCDfjZgTlZdMJnDJW
-lpThgTwtplhghgwhThqnnrdZctSZSjSZcRSRfbdrrc
-RBVBGvmBmfdrcvrbbr
-PmVGNGmmGRLLQwwLqTnglQ
-nHwnBwBTnFHQwRsMhwghmzcm
-GtprdCpdtqWdbqbrfdnPPszsWmRzRnShPszS
-dGptbCfCrlnVDBJNLDLLVDLQ
-CZtCjhTndCzqbCNq
-dwpGvpsmwGslDszrNNrzqDMzWMgJ
-vmcGccvpBVPTVTjTdTTTdZ
-jWZhvZLjZfCZDwrDrSSzJGhVdJccscGsgV
-blMBlRqqqgSJLBLcsJ
-blmHLmFMMMnRqLmMMFqHmfPDfjQDnCDDQrZvfCjvDr
-rnvnHrDLFZmMFLvrHQBMGQggBztzglplRl
-sbWWhdNzsshsfhcsjJJPPbWdtQGVGllRTRjRRgBgQlpRlppB
-PPCCwNWhPhNfWCzbqmFnDFFnCDLSrvZS
-GChNjwWlWJWTJZBggvdgnQgdhdnd
-HPsHfHHrpHDpFFrcSfsfpCMmQdntLBMgtmtBgDdLLC
-SqpPscpPzpSWzjlCjjCGjl
-nvgLvcLgvgvngbLprpJNTDCCRNVJrNPlDDTV
-WZsMtsffGQtMzWFqFmWmWsVNJNlDwwCDVRTwJlCCDVLz
-BQfGZGmmsMWFstWFmfMsfBccdncbpbSbvbbvHnLbpc
-tsmDsvswNZmcZTccfh
-zCTpGCbWBRWFWHGRFZJbMbJfnrhnhfMnnZ
-TzFGFBRLdpHHNNQddDQDvwQN
-fhBBpJgdHddjZQfmVmNzNNLmFN
-qvMRrvlbwqlbTTMBMvLssFNmVzzwFDmLLzVD
-TRSRWqRRMcBHhGHcdGgPGp
-lSjHmtmnpHStblnpSlHSrtmMzLWzqzqCZDDTzTTWqMFqCqVV
-sLRLLfPPRQfCTqqVVqFT
-dNJgRPNQNsJJhBRvdJvQvNNsjSrrSmrcctpbpHtBrBjLjmSH
-nwFwpppjfwSlpLTsqsTgNshhjM
-ccBRGvtsmgGNPqNNGP
-BCcJHvssdcWBCVmVHSSrZrwVzblpwbzZnf
-rcfQRrBPPczjcRBctZDNlnVNHbgZGjVDjN
-TvMsFJGSFMhJnNZlwVVnDNTZ
-qhSqqmqLCLhFdJLqSvLhmQRQRWcRPczPtzrCrWGRBp
-JVhdPhsFPFqLDBHVdHLPvhHDCMwcgJJwbwRgnnCMbwGwcmGC
-fzjzpTZTQQQLwCbgGgbMmQcR
-jzNpTzfSZtfNSWZlVVtdFFFDHHqLHVqv
-TwSNnSnSGVTpNppGlPTlTcVqQrRhVBqdqBRqZqQZqQ
-DcDCMfDbCMHJdrRBqbdjRBRZ
-gvftMCJHcHfCDmDLgfMmMmmWlwWnWsTTwlGTlWTwppNlGL
-pbGMbllDQPhhWWQDpPgVGlMCvRRrQLcCCcfBBQzLBcvQBv
-wqnJjSmjrstdqwwFBLcRsBRRszzLFC
-qwdddTJTdHtjndqJqHZHmwVWGpDbGTlbWWpWWrPGhhhM
-WGllqLjjLCpSffmBmvfpHs
-dnrQwZzRTdZwnCThdzzFTVmcBHBJBmsHfBPHcfvcSVHs
-QgQrzCdrTRCZzrZLbjGLqNMWGgNNLt
-sgPnhPPTTPTTwlJfwNHlqcfs
-LMCpFbLLbRpMGbMcCFLVlNlNqrHqVfbHHwNDwr
-GjBcCCtWMtMRZTSvgWQTngvg
-BCMtJJMpRDlMMvBJBBnfjtcjPhPmZgnhgdcf
-NrsrsqFNvrVLVGVrsHsqFgfmcPGdcmhfjdPgfjcnZd
-zFTzsNqHqFssLVLQqNTFbsBDwCCwvWlDwRMRCTRBDMDS
-zQtLgvggSRtgvVRtLvvnzdnjnGwGdmmrlpnlGz
-JssBFpqsDqPNnlWWjrrjqrnj
-DHDFBNDfPbJBsFHNMPvpvStQvMRVTtgVTVtv
-FvzttFvBTJJzLbvwhCnnVnWwjCnBNC
-mQdZgZPDPdPPSsMSQPdZgCwVGmnwnWpGnGhqNWjWCG
-ggdDgfQSdcjtFHjlLJfF
-ghcgScNNSsCvGSzmpVFlZbrzcFcV
-MWWRLRqqqdQwTtLjjmqMlFpFlzVnbFVDwplFzlDr
-LHMHqdHWjdQMdMtLHHLtWjJRsGCGSNghmSvPBJBNhsGfvfGP
-CbVqqqDbcbMHnnDqcCbrRFCfBvvwGjzrBwQGzrwwBjGwBQ
-sTPmpNWdWPTJssSSLPfNljjBvflGtjwwBzMG
-mmWgmgSZLTLMZWpnhqZbhFFCnhqnnn
-QQmjmZqnmQrfTZlbbcVbBcfbHfzf
-vpdSNShNppFdSRtdGBqvJBDlDzqbPPHVBH
-tRNSNRFhNpSRhFRMFtGhRGswLZZsZqWnmrmZwqwsTZmmmQ
-gGWCllFCGWtGGWdlGlWNZdwpnnSbwpMvpphZpndn
-RsshDDLcQVMSJQwJwnvw
-HVPzrPcDNhPFGhPC
-jtHQGHjGGtdTLjnqTQlmvRPRPBBwRBnFPPWP
-hZbzNzVrczZzcbNssVspZZVvBwbmPmJPWmvbBRvPlmvRJF
-fzNVDsZMhzpVhpVhlZcMNfcDDdQTLTjGDTCqGCjtSQHdHL
-GrbFggGrTrzSrgfwJjdTmwmNJZJd
-VMPQplPDptchwdsjmlml
-MqMWtBDPPWDWHQtvqQtWPjbzCGLgSBgGbzgrzFgnnz
-fcJccCcwcDfcpbRnCfWJnQJqtqtqPQdsGdgPsgTQqg
-LSjVMhzSFFrljdNbltNGtgdqQq
-MMhSHFFMLzBWDcHHcfcHwb
-rwmWtJWMwSNRJMtwNmMrrSsmtTjjlgqnTqZZZPlHnTngTTgn
-BGqGqqFBFggjjdGHlj
-QDhhLbDQCDFMNcmhRhqJNW
-BnRnRvMnLGLSCHvvSnlRfWbbTNQJsJsbNbJTBfQT
-tzMmmMwjhcpFjDmMcptrcjzFQggfQPTsWsfgNbbgfhJbPhQT
-FdzcrtDwDMtcwtFGRZdRLvdnHRSZZv
-HVpsSpvjpNjsBmbGFBnMNnDM
-WRRWhZtfrVtLJrBZMnDmDbnZBTGF
-thhPLzWzhzwPtLRLWrQlpPvvClcVcCppSvpl
-lZPbhnZLRPnnPZZPdlGMBWcBMgMQHBBcvvvzBL
-jpFjmwwwCDDbsjvjjgcvQgcNBQ
-rbFmppbwhqhGRGZr
-ggrLwFgWCBwbMWBbFwLMgNBZdmZHclJPllnJlNRPmSNZRR
-ppszzDfhDfhsqpnvDVTfGpSPlPmclHcdRcZmmmdPPGSP
-pvtDDVDVpqDfzDfngBLCwQrgCtCwFwrg
-pbGjFFGGDjpbsGsmNhNFNRBBBtRhhhHv
-JnczJVCvwWJvhPgghgNtNtNJ
-nwVSSzdzzqSpvQSZQG
-mssLLttQrsMrMzLCRmMmrrSQpvWpDNlBTBDlvNTccDQl
-HdHJwJqVPwHnqJwbjJbGjnSgSTWPpNgWWpgBBgcvDWWN
-ZHVwVZGwwdndqJVJqfHbGwnwrRLtLMftMvMMRrhmLMthhLmz
-RgHGLbTqlZlPRZPHfvvfZttJnvfvjnzr
-sVcChDVDccwNhhvjTvVzWJjnzFff
-mpNcCMTCGmLqBLGH
-wVJwHJHVMtMpBmDDWPQVPWDGDD
-zCrlZzCblBvnCDWNGLmvGDLPNG
-dqZglgbzrzbbgZqzTFSBHHFJSSSfjjSMfwhj
-NMWJSjLMCnHHNMNNHWCHMbVVGBPZTrPVPBVDrBSDGTTr
-zvttlFpgdtldwwvftPDPTWQdBZrsrWrGBZ
-hFlFmhRFvfCbmWJWHcnj

2022/inputs/05.txt

@@ -1,514 +0,0 @@
-        [G]         [D]     [Q]    
-[P]     [T]         [L] [M] [Z]    
-[Z] [Z] [C]         [Z] [G] [W]    
-[M] [B] [F]         [P] [C] [H] [N]
-[T] [S] [R]     [H] [W] [R] [L] [W]
-[R] [T] [Q] [Z] [R] [S] [Z] [F] [P]
-[C] [N] [H] [R] [N] [H] [D] [J] [Q]
-[N] [D] [M] [G] [Z] [F] [W] [S] [S]
- 1   2   3   4   5   6   7   8   9 
-
-move 7 from 6 to 8
-move 5 from 2 to 6
-move 2 from 4 to 1
-move 1 from 4 to 5
-move 5 from 7 to 6
-move 7 from 6 to 3
-move 5 from 9 to 2
-move 6 from 2 to 3
-move 2 from 7 to 9
-move 20 from 3 to 1
-move 11 from 1 to 6
-move 1 from 9 to 8
-move 3 from 8 to 2
-move 8 from 1 to 5
-move 10 from 8 to 4
-move 7 from 6 to 4
-move 1 from 8 to 3
-move 8 from 1 to 7
-move 16 from 4 to 8
-move 1 from 9 to 8
-move 1 from 5 to 2
-move 4 from 7 to 4
-move 5 from 6 to 7
-move 1 from 6 to 1
-move 8 from 7 to 4
-move 1 from 6 to 9
-move 12 from 4 to 5
-move 3 from 2 to 5
-move 1 from 6 to 2
-move 1 from 3 to 7
-move 1 from 3 to 2
-move 1 from 9 to 3
-move 1 from 7 to 8
-move 1 from 7 to 5
-move 1 from 3 to 2
-move 4 from 5 to 7
-move 5 from 5 to 7
-move 1 from 4 to 3
-move 1 from 3 to 9
-move 3 from 1 to 8
-move 1 from 9 to 1
-move 2 from 2 to 1
-move 2 from 2 to 7
-move 8 from 8 to 1
-move 3 from 5 to 2
-move 8 from 7 to 5
-move 7 from 1 to 3
-move 3 from 1 to 7
-move 1 from 1 to 5
-move 1 from 3 to 7
-move 7 from 5 to 8
-move 2 from 2 to 8
-move 1 from 3 to 2
-move 1 from 2 to 4
-move 1 from 4 to 8
-move 13 from 8 to 1
-move 13 from 5 to 9
-move 2 from 5 to 2
-move 7 from 9 to 3
-move 12 from 8 to 3
-move 4 from 9 to 3
-move 1 from 3 to 4
-move 2 from 2 to 3
-move 1 from 1 to 6
-move 1 from 2 to 3
-move 1 from 5 to 9
-move 7 from 7 to 4
-move 10 from 1 to 8
-move 1 from 1 to 4
-move 1 from 9 to 5
-move 2 from 5 to 1
-move 1 from 6 to 5
-move 3 from 8 to 9
-move 5 from 4 to 3
-move 4 from 4 to 1
-move 7 from 1 to 6
-move 2 from 5 to 7
-move 35 from 3 to 4
-move 4 from 9 to 1
-move 19 from 4 to 8
-move 1 from 7 to 6
-move 1 from 9 to 2
-move 10 from 4 to 5
-move 2 from 4 to 7
-move 3 from 4 to 3
-move 1 from 2 to 8
-move 1 from 1 to 9
-move 3 from 3 to 6
-move 4 from 8 to 6
-move 4 from 5 to 2
-move 2 from 8 to 3
-move 3 from 5 to 9
-move 12 from 6 to 1
-move 8 from 8 to 6
-move 2 from 9 to 1
-move 1 from 4 to 1
-move 1 from 3 to 8
-move 3 from 7 to 8
-move 2 from 9 to 7
-move 1 from 6 to 7
-move 10 from 6 to 8
-move 4 from 2 to 5
-move 1 from 3 to 7
-move 7 from 5 to 7
-move 13 from 8 to 1
-move 29 from 1 to 4
-move 8 from 7 to 8
-move 1 from 1 to 3
-move 3 from 7 to 6
-move 1 from 1 to 9
-move 15 from 4 to 1
-move 1 from 3 to 6
-move 10 from 1 to 6
-move 10 from 6 to 7
-move 1 from 4 to 9
-move 1 from 9 to 1
-move 1 from 9 to 7
-move 6 from 7 to 8
-move 1 from 1 to 6
-move 5 from 6 to 5
-move 21 from 8 to 9
-move 5 from 1 to 9
-move 2 from 9 to 5
-move 3 from 5 to 6
-move 3 from 7 to 9
-move 4 from 4 to 6
-move 6 from 8 to 7
-move 6 from 6 to 3
-move 2 from 7 to 9
-move 1 from 7 to 2
-move 6 from 3 to 2
-move 1 from 6 to 4
-move 4 from 5 to 9
-move 1 from 4 to 5
-move 9 from 4 to 6
-move 7 from 6 to 4
-move 10 from 9 to 2
-move 5 from 7 to 5
-move 10 from 2 to 7
-move 2 from 5 to 4
-move 2 from 5 to 9
-move 4 from 9 to 4
-move 1 from 8 to 6
-move 7 from 7 to 2
-move 1 from 5 to 4
-move 2 from 7 to 1
-move 1 from 5 to 7
-move 3 from 6 to 2
-move 4 from 4 to 5
-move 1 from 2 to 7
-move 10 from 4 to 7
-move 3 from 7 to 3
-move 17 from 9 to 4
-move 1 from 1 to 4
-move 1 from 1 to 5
-move 5 from 2 to 7
-move 1 from 9 to 2
-move 5 from 4 to 8
-move 2 from 9 to 7
-move 4 from 8 to 1
-move 3 from 4 to 8
-move 1 from 2 to 5
-move 1 from 9 to 2
-move 6 from 4 to 8
-move 3 from 7 to 5
-move 1 from 4 to 9
-move 1 from 9 to 1
-move 3 from 1 to 9
-move 4 from 8 to 5
-move 2 from 9 to 8
-move 4 from 2 to 5
-move 8 from 7 to 2
-move 5 from 8 to 5
-move 2 from 7 to 8
-move 1 from 3 to 5
-move 1 from 1 to 2
-move 1 from 1 to 6
-move 2 from 3 to 6
-move 5 from 2 to 8
-move 4 from 7 to 1
-move 7 from 8 to 5
-move 1 from 1 to 5
-move 3 from 8 to 3
-move 1 from 9 to 3
-move 7 from 2 to 3
-move 2 from 2 to 8
-move 2 from 4 to 8
-move 1 from 8 to 5
-move 1 from 1 to 4
-move 2 from 4 to 7
-move 2 from 7 to 1
-move 3 from 2 to 3
-move 3 from 5 to 2
-move 1 from 8 to 3
-move 3 from 3 to 2
-move 5 from 2 to 1
-move 17 from 5 to 8
-move 9 from 8 to 1
-move 11 from 3 to 5
-move 8 from 8 to 5
-move 2 from 8 to 5
-move 16 from 1 to 4
-move 13 from 4 to 7
-move 6 from 5 to 2
-move 2 from 4 to 8
-move 5 from 7 to 9
-move 2 from 1 to 2
-move 7 from 7 to 1
-move 1 from 1 to 4
-move 1 from 9 to 8
-move 7 from 2 to 8
-move 1 from 4 to 7
-move 2 from 9 to 4
-move 1 from 4 to 1
-move 1 from 3 to 5
-move 2 from 9 to 8
-move 11 from 8 to 7
-move 2 from 6 to 5
-move 1 from 6 to 9
-move 1 from 1 to 9
-move 1 from 9 to 1
-move 4 from 1 to 4
-move 2 from 1 to 8
-move 1 from 1 to 2
-move 1 from 9 to 5
-move 2 from 4 to 3
-move 2 from 2 to 7
-move 2 from 3 to 9
-move 1 from 9 to 1
-move 1 from 9 to 1
-move 5 from 5 to 1
-move 19 from 5 to 6
-move 5 from 1 to 4
-move 1 from 2 to 9
-move 1 from 1 to 3
-move 7 from 5 to 8
-move 1 from 3 to 6
-move 8 from 7 to 3
-move 7 from 4 to 8
-move 3 from 8 to 5
-move 1 from 4 to 1
-move 1 from 9 to 4
-move 1 from 4 to 9
-move 1 from 5 to 2
-move 2 from 5 to 6
-move 2 from 8 to 2
-move 7 from 8 to 1
-move 1 from 1 to 7
-move 3 from 6 to 9
-move 2 from 3 to 2
-move 1 from 2 to 1
-move 1 from 8 to 7
-move 2 from 9 to 6
-move 2 from 9 to 5
-move 1 from 5 to 6
-move 1 from 2 to 8
-move 2 from 1 to 7
-move 1 from 4 to 3
-move 3 from 2 to 5
-move 7 from 1 to 3
-move 10 from 3 to 4
-move 3 from 5 to 4
-move 1 from 3 to 8
-move 3 from 3 to 2
-move 1 from 8 to 1
-move 1 from 1 to 3
-move 3 from 8 to 3
-move 5 from 4 to 6
-move 1 from 2 to 3
-move 4 from 6 to 4
-move 1 from 5 to 7
-move 4 from 3 to 4
-move 1 from 2 to 8
-move 12 from 7 to 6
-move 1 from 8 to 2
-move 2 from 2 to 7
-move 1 from 8 to 4
-move 23 from 6 to 3
-move 14 from 3 to 6
-move 15 from 4 to 6
-move 1 from 8 to 6
-move 10 from 3 to 7
-move 2 from 4 to 2
-move 11 from 7 to 8
-move 2 from 2 to 6
-move 44 from 6 to 9
-move 21 from 9 to 3
-move 12 from 3 to 6
-move 1 from 7 to 4
-move 1 from 4 to 7
-move 9 from 3 to 2
-move 2 from 8 to 6
-move 3 from 2 to 4
-move 17 from 9 to 1
-move 3 from 4 to 6
-move 2 from 2 to 9
-move 4 from 9 to 2
-move 10 from 6 to 9
-move 1 from 7 to 6
-move 4 from 9 to 5
-move 4 from 2 to 4
-move 14 from 1 to 5
-move 4 from 4 to 3
-move 3 from 2 to 9
-move 9 from 9 to 7
-move 1 from 2 to 5
-move 9 from 8 to 5
-move 8 from 7 to 2
-move 4 from 3 to 8
-move 5 from 6 to 2
-move 3 from 1 to 6
-move 1 from 7 to 1
-move 4 from 2 to 4
-move 3 from 6 to 4
-move 3 from 8 to 3
-move 13 from 5 to 2
-move 2 from 3 to 5
-move 12 from 5 to 9
-move 1 from 3 to 5
-move 1 from 5 to 9
-move 1 from 8 to 3
-move 4 from 9 to 5
-move 6 from 4 to 5
-move 12 from 9 to 7
-move 1 from 9 to 3
-move 1 from 3 to 2
-move 12 from 5 to 6
-move 12 from 7 to 2
-move 1 from 3 to 7
-move 1 from 4 to 8
-move 33 from 2 to 8
-move 1 from 7 to 5
-move 1 from 1 to 2
-move 4 from 5 to 4
-move 3 from 2 to 5
-move 34 from 8 to 6
-move 1 from 4 to 3
-move 1 from 5 to 7
-move 1 from 7 to 5
-move 3 from 4 to 9
-move 2 from 9 to 7
-move 1 from 9 to 4
-move 1 from 3 to 7
-move 1 from 5 to 8
-move 1 from 5 to 1
-move 1 from 5 to 7
-move 1 from 4 to 8
-move 1 from 1 to 4
-move 1 from 4 to 2
-move 3 from 7 to 5
-move 2 from 8 to 5
-move 1 from 2 to 8
-move 4 from 6 to 2
-move 1 from 8 to 6
-move 1 from 7 to 9
-move 29 from 6 to 7
-move 4 from 2 to 3
-move 2 from 5 to 8
-move 1 from 9 to 5
-move 2 from 8 to 1
-move 23 from 7 to 5
-move 2 from 6 to 1
-move 23 from 5 to 6
-move 1 from 3 to 6
-move 4 from 5 to 9
-move 2 from 1 to 3
-move 5 from 3 to 8
-move 2 from 6 to 5
-move 2 from 1 to 4
-move 1 from 9 to 8
-move 1 from 9 to 1
-move 1 from 4 to 6
-move 2 from 5 to 6
-move 6 from 7 to 8
-move 2 from 9 to 2
-move 18 from 6 to 5
-move 21 from 6 to 4
-move 1 from 1 to 6
-move 2 from 6 to 7
-move 2 from 7 to 9
-move 2 from 2 to 8
-move 7 from 4 to 3
-move 12 from 5 to 3
-move 1 from 9 to 5
-move 1 from 9 to 4
-move 6 from 5 to 2
-move 17 from 3 to 4
-move 3 from 4 to 3
-move 1 from 2 to 4
-move 5 from 2 to 8
-move 1 from 5 to 8
-move 19 from 8 to 7
-move 1 from 3 to 6
-move 1 from 8 to 4
-move 1 from 6 to 1
-move 15 from 4 to 6
-move 1 from 1 to 4
-move 3 from 3 to 5
-move 4 from 6 to 7
-move 1 from 4 to 7
-move 10 from 6 to 7
-move 16 from 4 to 5
-move 24 from 7 to 2
-move 8 from 7 to 8
-move 1 from 4 to 2
-move 6 from 8 to 7
-move 1 from 8 to 7
-move 1 from 6 to 9
-move 14 from 5 to 4
-move 9 from 7 to 8
-move 4 from 5 to 1
-move 2 from 1 to 5
-move 3 from 8 to 6
-move 2 from 6 to 9
-move 2 from 2 to 8
-move 6 from 2 to 7
-move 3 from 4 to 6
-move 1 from 3 to 4
-move 3 from 5 to 7
-move 1 from 6 to 9
-move 5 from 7 to 2
-move 4 from 9 to 1
-move 1 from 7 to 9
-move 9 from 8 to 4
-move 5 from 1 to 2
-move 2 from 6 to 1
-move 6 from 4 to 7
-move 1 from 7 to 3
-move 1 from 3 to 9
-move 1 from 9 to 7
-move 1 from 6 to 7
-move 9 from 4 to 5
-move 7 from 7 to 9
-move 3 from 7 to 5
-move 1 from 9 to 2
-move 6 from 9 to 8
-move 4 from 4 to 5
-move 1 from 4 to 2
-move 1 from 4 to 2
-move 2 from 1 to 2
-move 1 from 9 to 8
-move 10 from 2 to 4
-move 8 from 2 to 7
-move 12 from 2 to 9
-move 6 from 7 to 4
-move 1 from 1 to 2
-move 8 from 9 to 8
-move 7 from 5 to 1
-move 9 from 4 to 3
-move 14 from 8 to 4
-move 1 from 8 to 4
-move 1 from 1 to 5
-move 1 from 5 to 2
-move 3 from 2 to 4
-move 1 from 7 to 1
-move 1 from 7 to 3
-move 2 from 1 to 7
-move 3 from 5 to 7
-move 2 from 7 to 6
-move 1 from 6 to 5
-move 3 from 7 to 1
-move 1 from 6 to 8
-move 1 from 8 to 7
-move 1 from 3 to 6
-move 1 from 7 to 1
-move 4 from 1 to 4
-move 6 from 3 to 2
-move 3 from 1 to 2
-move 3 from 3 to 6
-move 3 from 2 to 6
-move 6 from 6 to 5
-move 1 from 1 to 4
-move 1 from 9 to 6
-move 5 from 2 to 1
-move 3 from 1 to 2
-move 2 from 9 to 8
-move 3 from 1 to 5
-move 1 from 9 to 7
-move 25 from 4 to 1
-move 1 from 1 to 7
-move 2 from 8 to 3
-move 13 from 1 to 9
-move 2 from 3 to 5
-move 8 from 5 to 9
-move 4 from 2 to 1
-move 2 from 6 to 7
-move 10 from 5 to 9
-move 4 from 7 to 2
-move 2 from 2 to 3
-move 9 from 9 to 2
-move 4 from 4 to 5
-move 4 from 5 to 4
-move 5 from 1 to 4
-move 10 from 4 to 5
-move 22 from 9 to 1
-move 2 from 2 to 7
-move 3 from 2 to 1
-move 6 from 2 to 6
-move 1 from 7 to 1
-move 10 from 5 to 7
-move 15 from 1 to 4
-move 13 from 1 to 5
-move 3 from 6 to 8
-move 1 from 8 to 9

2022/inputs/06.txt

@@ -1 +0,0 @@
-grvrnvrnnjljbjqjpqjjvhhzwwrbwwbblrltrrpbbbbqnnqbbbbsvbvmbvmbbrsrqrzrllwbbbqzqrqnqrnrjnnjccdggwqqhrrjcjmjmllgrlglhlclmlvlvsshwwsggmfmdfddgdfftrrczrcczhzppgdgrdggghmmdwwqgggslglfgfcgccmjcjwjrwjrjcrjjsgjjvddpwpgpbbgwbgwwhnhfftbffhpfphhfqfrqfrfnfpprvrsrhrfrllfhhrsrhssvfsvsnvsnsswtwtlthllrjjwddtggzczgcchwcwppfbbdvdrdzrdrvrwwsbsfbssqfsfjsjcscttlztllgjjlbbdsdtssvvvwlvlqqnhqqtdqtddjcdcjjpbphhgtgtqtzqqzhqqtgtvtmvtvrvqrvvfmfmppzzbwwnddzttfpfrrlddbppfqppnwnswwdhwdwjjqljqqthtnhnddgmgcmgcmgcmmfmfttrzzfdzztllmjlllgcgbbcqcvccpnndbdjbjmmzbztzptzpprpddptpprhhvlvmlmpmmljjnnjsjfjjvgjjvzzfgfzfbftbftttgstgstgtpggflfcfqqtctltgltldlzdlzzmmlddnvddzfddppmnpptzptpvttwstwswvwrvvbfbjjjbmjjdvdvrvdddrwrhrzrqqhghhrwhwhrrmppsgpsgszzdfdfwwmtwtvwvgvffmqqqtqntqnnjcncbnbwnnzggrdrqqjbqjjwjqqqwlqwlwzlljhhfsfsqsrqqhwqqwbbqbvvlflrrlglbbjhhjmhjjcmcjcgczcfcgcqqczcnnvjnnlddmpmcppgvgjgddvrrnsnmnqmqgmmnppwgwcgwgssbddgtdgdgmdgmgvvmjmvmjmvvsfssdgdghdggbfbqbdbjbsbmmrpmrprggbllwrwpwtppzvppzsssdnsdnnvnhvvvzvfzfqqnnmlnltldtdvdbdblddsmmlccmlmvlmvmmcsctctrtsrstsbsrshsddlmddmppgsscttnrtrqqcvcwwlnlznnnvcnvvtnvnbnmbmvmppjgjdjtddmpdmdvvmgvvdqdlqlhhzccsggjdjsdsttctjctjtfjttppdzpzzbjbwwmwbblslzslzszlzrrcbrrfggvcczjjtbbdnnggbwblwlbwlwqqfvfqfddrrfccvlllhmhhhrthrthrrnbnzbbpzplphprrrnbbghhnshnhbblqqqvwwffnmnmhhtccpqpvqvbvnvvfnfsnffdjdllwffcddgcgrgjrggchcpcddtbbdtdmtdmmhhtphtpppclcpcvcjvcjjfqfzqqphpnhnrnhhpdhhtfhhbbmqmfmsmvssgqqfssqgglnnqmnmbnmbbllrdrgdrdvrdvdsvvnddgtgddcdqdsqdqbqqlhhwdhdgdcgcdchchrchhpvvpgvgrrfggwfwgmpddbhfngtrwswfszgsggnpsntjpslrpjqsffzrlnbnzdtqpqtjzwlhhgrsrbvnccnsjmzcbqgcbtbqlzhnpnhhrrvqwjwzzvrlcrmjhcscrqhpqmfzbnvcwwqhcjjlnggmpbwztzfswmsbjshnsgfmdlzvzczhrdwgwbghszpnbfpctrshbfhspsczcqcrrqcpwwpfzhjqtpqgjbztrpzrlgfdjbmlwdvlvnfmdzbwsbbhlbszvwcpztlchjrqbmsftltmqpfgdpmdgjvwqqtjsqlfqrwmsnlqgsbqfwsdnfvzthmbplvszfcmlptlcjpnfpjsphsmmjplwjqphgvzbtbjtpttqhlwtgnrjvmvsfsztmsqszzlhqqhfslsvhzgtsssfctzgsqbgdzlpwbsmpcnjqshhhcwqdsdzdhnjfqzqnqdlrpddcgrgldgqbjmdtwgppdczzrjvmcfqjbpjzbtjmgdphlbwnsnpfdqlhwvvmpwzsrztnwvtlbphljmjwsgbphgmwhdmfhpvsmvsjccjhfvqtvfmmlnggncltvtrgmbtfqsvfnlvcmjnjwzcrpjnsgntvhjbtdlptshbhhchqmsprhqzdnfpjqccdfvnzjtlbsmmwvzlwlvmsbrnhqctvtvbfhntdctjnrbcrrlmsnwbbjbcbbgrrhfqwzwwfgvsvgbwnttghtgpspzwzfhffsqjvwwttntnvlwftsfvtttgnprzrzsghvjrdtsfdvzswhmrfcdqsgvrlhzbnvbmjlqrftnnbtwqtvlvwznfbslhdqjbntdgpprfqchjvgvzjssdztjlzwfljjmfvzrbbtczggzqwrnqqgzzcbqjcpfqfrbwtdjrrvbszsjdjcpdfjscsvnltcgwvqsgnhbfgnfnddnpmbzbptrmvqzpvbdpfdvtlmgnnjwflgdbfnmvsdnmlvgcpwflwvdbtbfwtfpsmqsplnzwlwgvbjrhghwrnrswsggbqpdjcjrgbgnsqdvwzzwftvjqgjzzcdvpbbjzpphmbcqmrjvgqwfgrsnqvhwflmhgrlvbpwdcsrlqwfrwppqbrdhwqtvczpclpsbsjcptgblbbsqmbhjjgzwvlcnhnzcttmpjsgchmppgphqlzlcsqcgbbjgtjjvmttdztfdptzgvmpnqrcmpmcdlpnbztllvqbggqbqhlqvdwsrwzsjwfrqvcbvsgfdptmrzpvdfblmhlzrvpmsljlqqzrhlnmwncpfhvqlsbtrjbfcrnfvjvddrhdbbczjdsrdvzlbqrccssdzcpmdsqbprjppfzdwfdswptgzcmjqfhcwsqfqhvrslffqfbcvhdzljzrmtwmfdwzdhhjcmbjtvjhzzwfqhrcslztdbnlwmmhbbbgdscjcdzftnchqfnflnsdqjscfrqpnfbftpzvtmrwncqfqqflschpfnjsjlqcjdjgtwpqhgcnjdmnnvmmpwdspmnrgqrptqwcvbtdwpqlbtwpqgwgfrzlrhtvrvzhmhmwhfdsrhpcczqfltsgtgrfwcvlcvtlhqqwnrqgzpnzbfmzbdwqwbsfvbshrgzqdbgvrhzhzlbqsfzttmsnmrqmwgtzbvdqdrbgcpclzjrhdbjtpcdbbznjgtbwbqrnpvffdmwtrbhhstcmnjcwbbnmpbvmjprtzgcptmtrffwhvfgdljnrbbrblbfbgdwtjrtgqgrpvpgjqrjzczvvlspgdbzftqgqvgdqlglbgvgjdcztznszcwfqhmwbrbjcfstzdcmdsssqfhtzpdgmzjscvbdzgbhhgdqgvfwrzmhdrhlsvlzjjzbzdljcbhncppwrtptjgszlqsrqpzqcsgvdvzmgvwgsncnbffttslphcstqvfwbwzbflmshcbnhpljgqwmmwwzlgpbcqnrtqlwcjcrclfdrnnmvtbfdztdfvtqrsgdptfcfpzpsldhzmrngggfvdqggtlfqqwsldprcffsstnnpmsbbvghdbpprqbssnprdbqclzqtgsrczwcvqwrrfmmfwsndvtvqljwwglrgbphdvvwgctbbmtrbpzqtspgrlhmnhjcdwhwvssgspzjbcfjttjqbdpdmptfzzjcfqljpqddfssmffqprvbptfvdshsdmfmdtmlbnmbmjjjsgmlmwmgcwhbrbgchrstptvdlqgddfzddlzhwjmsvvcjwvqtzjtsctfmzchlbrvlgdzbvdlbfpvhptpltrdmcgjghcpwvwqqnrzdtnmgdncplhdpsgpnbprbgshffwwsdhpgqsbmwdtpnhhltlcqfrjtswcchzvlhdgrmjwhgwppdjqlgmdhwbllqvzrchgclmqdlghjsvmwlflmhhmdzbfjhjnvwphnjbclmdpgflqgtfsmsjslntfcmtbphnrgpdcqtjzjttdtgjmvhzsrfnrjqssvwpcslpfstbpfsrsntmftmdgsqrrsnddqfmchrhtlhmqndvvllnvltdzfphjqnvmcdsgfpcmjftgdpntjzplqljhtthvnbzbzwvfnqsjvnfwhmtbsspjslgfjvdgfjpwrsgqwntntjcqtdgnhnsfwhhqfwbwhdrftj

2022/src/common.rs

@@ -1,7 +1,6 @@
 //! Common helper utilities to all days
 
 use anyhow::Result;
-use nom::combinator::map;
 use nom::error::ErrorKind;
 use nom::error::ParseError;
 use nom::Finish;
@@ -93,26 +92,3 @@ where
         }
     }
 }
-
-/// Add an index to repeated successful invocations of the embedded parser.
-pub fn enumerate<I, O, E>(f: impl Parser<I, O, E>) -> impl FnMut(I) -> IResult<I, (usize, O), E> {
-    let mut index = 0usize;
-
-    map(f, move |v| {
-        let res = (index, v);
-        index += 1;
-        res
-    })
-}
-
-/// Return the minimum and maximum of two unordered variables
-pub fn minmax<T>(a: T, b: T) -> (T, T)
-where
-    T: PartialOrd,
-{
-    if a < b {
-        (a, b)
-    } else {
-        (b, a)
-    }
-}

2022/src/day01.rs

@@ -2,6 +2,7 @@ use std::ops::Add;
 
 use anyhow::Result;
 use nom::character::complete::newline;
+use nom::combinator::opt;
 use nom::multi::separated_list0;
 use nom::sequence::terminated;
 use nom::IResult;
@@ -13,9 +14,13 @@ fn parse_elf(input: &[u8]) -> IResult<&[u8], i32> {
     reduce_many1(terminated(nom::character::complete::i32, newline), Add::add)(input)
 }
 
+fn parse_max(input: &[u8]) -> IResult<&[u8], i32> {
+    reduce_many1(terminated(parse_elf, opt(newline)), Ord::max)(input)
+}
+
 pub fn part1(input: &[u8]) -> Result<String> {
-    let elves = parse_input(input, parse_elf_list)?;
-    Ok(elves.into_iter().fold(0, Ord::max).to_string())
+    let result = parse_input(input, parse_max)?.to_string();
+    Ok(result)
 }
 
 fn parse_elf_list(input: &[u8]) -> IResult<&[u8], Vec<i32>> {

2022/src/day02.rs

@@ -1,12 +1,15 @@
+use std::ops::Add;
+
 use anyhow::Result;
 use nom::character::complete::newline;
+use nom::combinator::map;
 use nom::combinator::map_res;
-use nom::multi::many0;
 use nom::sequence::separated_pair;
 use nom::sequence::terminated;
 use nom::IResult;
 
 use crate::common::parse_input;
+use crate::common::reduce_many1;
 
 #[derive(Copy, Clone, Eq, PartialEq)]
 enum Rps {
@@ -70,7 +73,7 @@ impl TryFrom<u8> for Rps {
     }
 }
 
-fn parse_plan(input: &[u8]) -> IResult<&[u8], Vec<(Rps, Rps)>> {
+fn parse_line(input: &[u8]) -> IResult<&[u8], (Rps, Rps)> {
     fn parse_rps(input: &[u8]) -> IResult<&[u8], Rps> {
         // Note: alpha1 also sort of works but is significantly slower
         map_res(nom::bytes::complete::take(1usize), |v: &[u8]| {
@@ -78,33 +81,34 @@ fn parse_plan(input: &[u8]) -> IResult<&[u8], Vec<(Rps, Rps)>> {
         })(input)
     }
 
-    fn parse_line(input: &[u8]) -> IResult<&[u8], (Rps, Rps)> {
-        separated_pair(parse_rps, nom::character::complete::char(' '), parse_rps)(input)
-    }
-
-    many0(terminated(parse_line, newline))(input)
+    terminated(
+        separated_pair(parse_rps, nom::character::complete::char(' '), parse_rps),
+        newline,
+    )(input)
 }
 
 pub fn part1(input: &[u8]) -> Result<String> {
-    let plan = parse_input(input, parse_plan)?;
-
-    let result: u32 = plan
-        .into_iter()
-        .map(|(them, us)| us.score() + us.score_against(them))
-        .sum();
-
-    Ok(result.to_string())
+    parse_input(
+        input,
+        reduce_many1(
+            map(parse_line, |(them, us)| us.score() + us.score_against(them)),
+            Add::add,
+        ),
+    )
+    .map(|sum| sum.to_string())
 }
 
 pub fn part2(input: &[u8]) -> Result<String> {
-    let plan = parse_input(input, parse_plan)?;
-
-    let result: u32 = plan
-        .into_iter()
-        .map(|(them, us)| us.score_result() + us.needed(them).score())
-        .sum();
-
-    Ok(result.to_string())
+    parse_input(
+        input,
+        reduce_many1(
+            map(parse_line, |(them, us)| {
+                us.score_result() + us.needed(them).score()
+            }),
+            Add::add,
+        ),
+    )
+    .map(|sum| sum.to_string())
 }
 
 #[cfg(test)]

2022/src/day03.rs

@@ -1,79 +1,9 @@
 use anyhow::Result;
-use itertools::Itertools;
 
-fn priority(item: u8) -> u32 {
-    match item {
-        b'a'..=b'z' => item - b'a' + 1,
-        b'A'..=b'Z' => item - b'A' + 27,
-        _ => 0,
-    }
-    .into()
+pub fn part1(_input: &[u8]) -> Result<String> {
+    todo!()
 }
 
-fn seen(backpack: &[u8]) -> u64 {
-    let mut seen = 0;
-
-    for &b in backpack {
-        seen |= 1 << priority(b);
-    }
-
-    seen
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    let mut total = 0;
-
-    for line in input.split(|&b| b == b'\n') {
-        let (first, last) = line.split_at(line.len() / 2);
-
-        let seen = seen(first);
-
-        for &b in last {
-            let prio = priority(b);
-
-            if (seen & (1 << prio)) != 0 {
-                total += prio;
-                break;
-            }
-        }
-    }
-
-    Ok(total.to_string())
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    let mut total = 0;
-
-    for chunk in &input.split(|&b| b == b'\n').chunks(3) {
-        let mut mask = u64::MAX;
-
-        for backpack in chunk {
-            let seen = seen(backpack);
-            mask &= seen;
-        }
-
-        if mask != 0 {
-            debug_assert_eq!(1, mask.count_ones());
-            total += mask.trailing_zeros();
-        }
-    }
-
-    Ok(total.to_string())
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLE: &[u8] = include_bytes!("samples/03.txt");
-
-    #[test]
-    fn sample_part1() {
-        assert_eq!(part1(SAMPLE).unwrap(), "157")
-    }
-
-    #[test]
-    fn sample_part2() {
-        assert_eq!(part2(SAMPLE).unwrap(), "70")
-    }
+pub fn part2(_input: &[u8]) -> Result<String> {
+    todo!()
 }

2022/src/day04.rs

@@ -1,86 +1,9 @@
 use anyhow::Result;
-use nom::bytes::complete::tag;
-use nom::character::complete::newline;
-use nom::combinator::map;
-use nom::multi::many0;
-use nom::sequence::separated_pair;
-use nom::sequence::terminated;
-use nom::IResult;
 
-use crate::common::minmax;
-use crate::common::parse_input;
-
-#[derive(Copy, Clone, PartialOrd, PartialEq)]
-struct Assignment(u32, u32);
-
-impl Assignment {
-    fn one_contains(self, other: Self) -> bool {
-        let (first, second) = minmax(self, other);
-
-        if second.0 == first.0 {
-            first.1 <= second.1
-        } else {
-            second.0 <= first.1 && second.1 <= first.1
-        }
+pub fn part1(_input: &[u8]) -> Result<String> {
+    todo!()
 }
 
-    fn one_overlaps(self, other: Self) -> bool {
-        let (first, second) = minmax(self, other);
-
-        if second.0 == first.0 {
-            first.1 <= second.1
-        } else {
-            second.0 <= first.1
-        }
-    }
-}
-
-fn parse_assignments(input: &[u8]) -> IResult<&[u8], Vec<(Assignment, Assignment)>> {
-    use nom::character::complete::u32;
-
-    fn parse_single(input: &[u8]) -> IResult<&[u8], Assignment> {
-        map(separated_pair(u32, tag("-"), u32), |(start, end)| {
-            Assignment(start, end)
-        })(input)
-    }
-
-    let parse_line = separated_pair(parse_single, tag(","), parse_single);
-
-    many0(terminated(parse_line, newline))(input)
-}
-
-fn parts_common(input: &[u8], filter: impl Fn(Assignment, Assignment) -> bool) -> Result<String> {
-    let assigments = parse_input(input, parse_assignments)?;
-
-    let overlapping = assigments
-        .into_iter()
-        .filter(|&(a, b)| filter(a, b))
-        .count();
-
-    Ok(overlapping.to_string())
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    parts_common(input, Assignment::one_contains)
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    parts_common(input, Assignment::one_overlaps)
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLE: &[u8] = include_bytes!("samples/04.txt");
-
-    #[test]
-    fn sample_part1() {
-        assert_eq!(part1(SAMPLE).unwrap(), "2")
-    }
-
-    #[test]
-    fn sample_part2() {
-        assert_eq!(part2(SAMPLE).unwrap(), "4")
-    }
+pub fn part2(_input: &[u8]) -> Result<String> {
+    todo!()
 }

2022/src/day05.rs

@@ -1,166 +1,9 @@
-use std::cmp::Ordering;
-
 use anyhow::Result;
-use nom::branch::alt;
-use nom::bytes::complete::tag;
-use nom::bytes::complete::take;
-use nom::bytes::complete::take_until;
-use nom::character::complete::newline;
-use nom::combinator::map;
-use nom::combinator::opt;
-use nom::multi::fold_many1;
-use nom::multi::many1;
-use nom::sequence::delimited;
-use nom::sequence::preceded;
-use nom::sequence::terminated;
-use nom::sequence::tuple;
-use nom::IResult;
 
-use crate::common::enumerate;
-use crate::common::parse_input;
-
-type Move = (usize, usize, usize);
-type OwnedStacks = Vec<Vec<u8>>;
-
-fn parse_row<'a>(input: &'a [u8], stacks: &mut OwnedStacks) -> IResult<&'a [u8], ()> {
-    // Forgive me for this crime
-    fold_many1(
-        enumerate(terminated(
-            alt((
-                // Parse a delimited value into a Some(content)
-                map(delimited(tag("["), take(1usize), tag("]")), |v: &[u8]| {
-                    Some(v[0])
-                }),
-                // Or an empty stack into a None
-                map(tag("   "), |_| None),
-            )),
-            opt(tag(" ")),
-        )),
-        || (),
-        move |_, (index, c)| {
-            if let Some(b) = c {
-                if stacks.len() <= index {
-                    stacks.resize_with(index + 1, Vec::new);
+pub fn part1(_input: &[u8]) -> Result<String> {
+    todo!()
 }
 
-                stacks[index].push(b)
-            }
-        },
-    )(input)
-}
-
-fn parse_stacks(input: &[u8]) -> IResult<&[u8], OwnedStacks> {
-    let mut stacks = Vec::new();
-
-    let (input, _) = terminated(
-        fold_many1(
-            terminated(|input| parse_row(input, &mut stacks), newline),
-            || (),
-            |_, _| (),
-        ),
-        // Skip the line with the numbers
-        take_until("\n\n"),
-    )(input)?;
-
-    // Reverse the stacks since we parsed them top-down
-    for stack in &mut stacks {
-        stack.reverse();
-    }
-
-    Ok((input, stacks))
-}
-
-fn parse_task(input: &[u8]) -> IResult<&[u8], (OwnedStacks, Vec<Move>)> {
-    fn parse_usize(input: &[u8]) -> IResult<&[u8], usize> {
-        map(nom::character::complete::u32, |v| v as usize)(input)
-    }
-    let (input, stacks) = parse_stacks(input)?;
-
-    // Consume the double newline
-    let (input, _) = tag("\n\n")(input)?;
-
-    let (input, moves) = many1(terminated(
-        tuple((
-            preceded(tag("move "), parse_usize),
-            preceded(tag(" from "), parse_usize),
-            preceded(tag(" to "), parse_usize),
-        )),
-        newline,
-    ))(input)?;
-
-    Ok((input, (stacks, moves)))
-}
-
-/// Some magic to get two mutable references into the same slice
-fn get_both(stacks: &mut [Vec<u8>], from: usize, to: usize) -> (&mut Vec<u8>, &mut Vec<u8>) {
-    match from.cmp(&to) {
-        Ordering::Greater => {
-            let (begin, end) = stacks.split_at_mut(from);
-            (&mut end[0], &mut begin[to])
-        }
-        Ordering::Less => {
-            let (begin, end) = stacks.split_at_mut(to);
-            (&mut begin[from], &mut end[0])
-        }
-        Ordering::Equal => panic!("Tried to stack from and to {from}"),
-    }
-}
-
-fn compute_answer(stacks: &mut [Vec<u8>]) -> Result<String> {
-    let mut result = String::with_capacity(stacks.len());
-
-    for stack in stacks {
-        result.push(
-            *stack
-                .last()
-                .ok_or_else(|| anyhow::anyhow!("Encountered empty stack"))? as char,
-        );
-    }
-
-    Ok(result)
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    let (mut stacks, moves) = parse_input(input, parse_task)?;
-
-    for (count, from, to) in moves {
-        let (from, to) = get_both(&mut stacks, from - 1, to - 1);
-
-        let drain_start = from.len() - count;
-
-        to.extend(from.drain(drain_start..).rev());
-    }
-
-    compute_answer(&mut stacks)
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    let (mut stacks, moves) = parse_input(input, parse_task)?;
-
-    for (count, from, to) in moves {
-        let (from, to) = get_both(&mut stacks, from - 1, to - 1);
-
-        let drain_start = from.len() - count;
-
-        to.extend(from.drain(drain_start..));
-    }
-
-    compute_answer(&mut stacks)
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLE: &[u8] = include_bytes!("samples/05.txt");
-
-    #[test]
-    fn sample_part1() {
-        assert_eq!(part1(SAMPLE).unwrap(), "CMZ");
-    }
-
-    #[test]
-    fn sample_part2() {
-        assert_eq!(part2(SAMPLE).unwrap(), "MCD");
-    }
+pub fn part2(_input: &[u8]) -> Result<String> {
+    todo!()
 }

2022/src/day06.rs

@@ -1,68 +1,9 @@
 use anyhow::Result;
 
-fn find_first(input: &[u8], unique: usize) -> Result<usize> {
-    let mut seen = [false; 256];
-
-    let mut tail_it = input.iter();
-
-    let mut first = 0;
-
-    // Loop invariant: input[first..last] contains only unique characters
-    for (last, &c) in input.iter().enumerate() {
-        if seen[c as usize] {
-            first += (&mut tail_it)
-                .take_while(|&&b| b != c)
-                .map(|&b| seen[b as usize] = false)
-                .count()
-                + 1; // +1 because take_while doesn't return the first element that didn't satisfy the condition, while we do need to count it
-        } else {
-            // New unique character found: input[first..=last] contains unique characters
-            if last - first + 1 == unique {
-                return Ok(last + 1);
+pub fn part1(_input: &[u8]) -> Result<String> {
+    todo!()
 }
 
-            seen[c as usize] = true;
-        }
-    }
-
-    anyhow::bail!("Did not find unique sequence of length {unique}");
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    Ok(find_first(input, 4)?.to_string())
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    Ok(find_first(input, 14)?.to_string())
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLES: &[&[u8]] = &[
-        b"mjqjpqmgbljsphdztnvjfqwrcgsmlb",
-        b"bvwbjplbgvbhsrlpgdmjqwftvncz",
-        b"nppdvjthqldpwncqszvftbrmjlhg",
-        b"nznrnfrfntjfmvfwmzdfjlvtqnbhcprsg",
-        b"zcfzfwzzqfrljwzlrfnpqdbhtmscgvjw",
-    ];
-
-    #[test]
-    fn sample_part1() {
-        const CORRECT: &[usize] = &[7, 5, 6, 10, 11];
-
-        for (&sample, &correct) in SAMPLES.iter().zip(CORRECT) {
-            assert_eq!(find_first(sample, 4).unwrap(), correct);
-        }
-    }
-
-    #[test]
-    fn sample_part2() {
-        const CORRECT: &[usize] = &[19, 23, 23, 29, 26];
-
-        for (&sample, &correct) in SAMPLES.iter().zip(CORRECT) {
-            assert_eq!(find_first(sample, 14).unwrap(), correct);
-        }
-    }
+pub fn part2(_input: &[u8]) -> Result<String> {
+    todo!()
 }

2022/src/samples/03.txt

@@ -1,6 +0,0 @@
-vJrwpWtwJgWrhcsFMMfFFhFp
-jqHRNqRjqzjGDLGLrsFMfFZSrLrFZsSL
-PmmdzqPrVvPwwTWBwg
-wMqvLMZHhHMvwLHjbvcjnnSBnvTQFn
-ttgJtRGJQctTZtZT
-CrZsJsPPZsGzwwsLwLmpwMDw

2022/src/samples/04.txt

@@ -1,6 +0,0 @@
-2-4,6-8
-2-3,4-5
-5-7,7-9
-2-8,3-7
-6-6,4-6
-2-6,4-8

2022/src/samples/05.txt

@@ -1,9 +0,0 @@
-    [D]    
-[N] [C]    
-[Z] [M] [P]
- 1   2   3 
-
-move 1 from 2 to 1
-move 3 from 1 to 3
-move 2 from 2 to 1
-move 1 from 1 to 2