\nmain(){char x[14];long i,j;/* i++; repeated 2406167339672739884 times */ /* j++; repeated 478560413000 times */memcpy(x,&j,8);memcpy(x+5,&i,8);puts(x);}\n```\n[Try an equivalent version online!](https://tio.run/##PcjdCsIgGADQ@55iEAwlC51OHbZeJLoYNtwn0439gBE9u9FNl@fYs7M25yNEO@7P/rpuC0R3GW6H0EFE@G2HbinSnYmHGafoCiDeQFsJKplUnDdSVYo3WgvjW6F0LalgnFJqQh/s/EKJlJ5o/OepJiX8Yt63FSVsPjl/AQ/##VcrdCoIwGIDh867ig0D8WTnd3CaLbiQ6kDl04pboBCO69lUHBR2@L486dEqFsDdOjWurT4ufjeuO/XlnG@Pi5KH6ZobtUtCrHG@uA4MGmadgskzCrCfdeN1CSTErGCekZrzkpBaCgjdWL5Dm8NbDn6ZcVAzTgmCMf8xqq6Z7vKFoQCKR38wqFJnPmFa/xFsinyG8AA \"C (gcc) – Try It Online\")\nFor some reason I can't post the full program, so it has been abbreviated in the comments.\n]"}}},{"rowIdx":13888,"cells":{"text":{"kind":"string","value":"[Question]\n [\n**Closed**. This question needs [details or clarity](/help/closed-questions). It is not currently accepting answers.\n \n \n---\n**Want to improve this question?** Add details and clarify the problem by [editing this post](/posts/220031/edit).\nClosed 2 years ago.\n[Improve this question](/posts/220031/edit) \nyour challenge is to draw this ASCII art:\n```\n| | |- - - - | | - - - \n| | | | | | | \n|- - -| |- - - | | | | \n| | | | | | | \n| | |- - - - |- - - |- - - - - -\n```\nremember this is `code golf` meaning you have to answer in the least amount of bytes possible.\nEDIT: spacing between letters is two spaces. the only symbols used are | and -. NO underscores. i added spaces between the dashes to make it easier to see how many there are\n \n[Answer]\n# [05AB1E](https://github.com/Adriandmen/05AB1E), 52 bytes\n```\n•C\"¹Ò∞ʒÓŸ2ýŸ¦ÙLŒðd4Í}‡éλPÓãžãš±àýEŽª™§M₆2•… |-ÅвJ5ä»\n```\n[Try it online!](https://tio.run/##AWkAlv9vc2FiaWX//@KAokMiwrnDkuKInsqSw5PFuDLDvcW4wqbDmUzFksOwZDTDjX3igKHDqc67UMOTw6PFvsOjxaHCscOgw71Fxb3CquKEosKnTeKChjLigKLigKYgfC3DhdCySjXDpMK7//8 \"05AB1E – Try It Online\")\n```\n•...•… |-ÅвJ5ä» # full program\n » # join...\n J # joined...\n Åв # characters in...\n … |- # literal...\n Åв # with indices in digits of...\n•...• # 88667318995411980279046696478254356886483104218636819581201379955454517801745112819324119476267...\n Åв # in base length of...\n … |- # literal...\n ä # split into...\n 5 # literal...\n ä # equal sized pieces...\n » # by newlines\n # implicit output\n```\n[Answer]\n# [PHP](https://php.net/), 63 bytes\n```\n=gzinflate('«Q ÒU€@&`a^®¸J4Èt\nP%XÂL<*‰7‹;Ñh0');\n```\n**WARNING**: this code contains many non-printable chars and a function that is disabled in most online code testers. It is either impossible to enter the correct code on their sites or run the function. Here is the php file I uploaded to gitHub so that you can test (I recommend using `` tags to see it as intended in a browser, because of spaces being narrower than `—`, and new lines ignored in HTML):\n[Try it OFFline!](https://github.com/Kaddath-R/Shared-Files/blob/main/SE-Golf/220031-ascii-hello.php)\nWell this is a one-time trick that is becoming recurrent, and quite boring, as all I need to do is reuse the script I made to generate the file, replace the string and run it. So this is the last time I'll use this trick, and I post it as a demonstration of why these challenges are not that much interesting IMO.\nEDIT: updated the answer and the file with edited question (the string is shorter, so from 94 bytes originally to 63)\n[Answer]\n# [Charcoal](https://github.com/somebody1234/Charcoal), 54 bytes\n```\n≔…- ⁵θ↓³↗→θ↑³Mχ¹←…- ⁷↓³↗→θM²⁰→P↑²M⁴→↑²←θ‖O↓F²«←←←θP↑⁵←\n```\n[Try it online!](https://tio.run/##nY7dCoIwGIaP9SqGRxsopCWBHYUdJongBciYOhhuzWVEdO1rJuLfWYff@z3vD64LiXnBtD63La0aGL8wI3HNBXQ84LggRC64o5OdStooGF34s3HB3ggJ7wiMcpHRqlYT8DsXllzMDP7OBf70u5LSwOvOI/qv8EcEpiEameTBFBXTjmCkDjMoXf4X0/rYjJSMYHXriGSFGCYZueQSwACBt20N03qH0VfXJs5ajwo3po/W2uvYFw \"Charcoal – Try It Online\") Link is to verbose version of code. Explanation:\n```\n≔…- ⁵θ\n```\nConstruct the string `- - -` as it gets used a lot.\n```\n↓³↗→θ↑³\n```\nDraw the top half of the `H`.\n```\nMχ¹←…- ⁷↓³↗→θ\n```\nDraw the top half of the `E`.\n```\nM²⁰→P↑²M⁴→↑²←θ\n```\nDraw the top half of the `O`.\n```\n‖O↓\n```\nReflect to complete the `HE O`.\n```\nF²«←←←θP↑⁵←\n```\nDraw two `L`s.\nOr I could just do boring string compression for 51 bytes:\n```\n”~∨CθOÀ·y←B~⊟⧴n^;δS3E⊖⎇✂↶0¶KZ7≦%⊕wG4H⁻φ|ePυυ[qπ<Φ⊙›\n```\n[Try it online!](https://tio.run/##S85ILErOT8z5/z@gKDOvREOpRgEEgGSNrgIEKkCEEDRYOCYPoVJBAU0FMl0DVAnWgTATj0rizcTiTjQaTClpWv///1@3LAcA \"Charcoal – Try It Online\") Link is to verbose version of code.\nIf there were no spaces in the horizontal lines, it would be only 44 bytes:\n```\n↓³↗→⁵↑³Mχ¹←⁷↓³↗→⁵M²⁴→↑²←⁴P↓³←¹‖O↓F²«←←←⁵P↑⁵←\n```\n[Try it online!](https://tio.run/##S85ILErOT8z5/z@gKDOvRMPKJb88T0fBWNOayze/LFXDKrQgKDM9owTIhyoAc3UUTBEioQVIGgwNdBQMEXI@qWlAxeYIAVLMB6swMtFRsEJTA7LRCN0SE5CO0pySzAJ0m1CUgRwXlJqWk5pc4l@WWpSTWABRChROyy9S0DDSVKjm4oQ4DqQDKI7GQzHOFCyPZC3IbaYYmmr///@vW5YDAA \"Charcoal – Try It Online\") Link is to verbose version of code.\n]"}}},{"rowIdx":13889,"cells":{"text":{"kind":"string","value":"[Question]\n [\n**Closed**. This question needs [details or clarity](/help/closed-questions). It is not currently accepting answers.\n \n \n---\n**Want to improve this question?** Add details and clarify the problem by [editing this post](/posts/95129/edit).\nClosed 7 years ago.\n[Improve this question](/posts/95129/edit) \nIt is currently December 31, 2015, 11:59:00pm, and you must be at least 1324900 seconds old to be able to go to the New Year Celebration. Given the year, month, day, hour, minute, and second of your birth, determine if you are old enough to go.\nNotes:\n* Assume that you are in the same timezone.\n* Leap years are every 4 years, but if the year is a multiple of 100, it is not a leap year, unless it is a multiple of 400.\nRemember, this is [code-golf](/questions/tagged/code-golf \"show questions tagged 'code-golf'\"), so the code with the smallest number of bytes wins.\n## Leaderboards\nHere is a Stack Snippet to generate both a regular leaderboard and an overview of winners by language.\nTo make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:\n```\n# Language Name, N bytes\n```\nwhere `N` is the size of your submission. If you improve your score, you *can* keep old scores in the headline, by striking them through. For instance:\n```\n# Ruby, 104 101 96 bytes\n```\nIf there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the *last* number in the header:\n```\n# Perl, 43 + 2 (-p flag) = 45 bytes\n```\nYou can also make the language name a link which will then show up in the leaderboard snippet:\n```\n# [><>](http://esolangs.org/wiki/Fish), 121 bytes\n```\n```\nvar QUESTION_ID=95129,OVERRIDE_USER=12537;function answersUrl(e){return\"https://api.stackexchange.com/2.2/questions/\"+QUESTION_ID+\"/answers?page=\"+e+\"&pagesize=100&order=desc&sort=creation&site=codegolf&filter=\"+ANSWER_FILTER}function commentUrl(e,s){return\"https://api.stackexchange.com/2.2/answers/\"+s.join(\";\")+\"/comments?page=\"+e+\"&pagesize=100&order=desc&sort=creation&site=codegolf&filter=\"+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:\"get\",dataType:\"jsonp\",crossDomain:!0,success:function(e){answers.push.apply(answers,e.items),answers_hash=[],answer_ids=[],e.items.forEach(function(e){e.comments=[];var s=+e.share_link.match(/\\d+/);answer_ids.push(s),answers_hash[s]=e}),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:\"get\",dataType:\"jsonp\",crossDomain:!0,success:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&&answers_hash[e.post_id].comments.push(e)}),e.has_more?getComments():more_answers?getAnswers():process()}})}function getAuthorName(e){return e.owner.display_name}function process(){var e=[];answers.forEach(function(s){var r=s.body;s.comments.forEach(function(e){OVERRIDE_REG.test(e.body)&&(r=\"\"+e.body.replace(OVERRIDE_REG,\"\")+\"
\")});var a=r.match(SCORE_REG);a&&e.push({user:getAuthorName(s),size:+a[2],language:a[1],link:s.share_link})}),e.sort(function(e,s){var r=e.size,a=s.size;return r-a});var s={},r=1,a=null,n=1;e.forEach(function(e){e.size!=a&&(n=r),a=e.size,++r;var t=jQuery(\"#answer-template\").html();t=t.replace(\"{{PLACE}}\",n+\".\").replace(\"{{NAME}}\",e.user).replace(\"{{LANGUAGE}}\",e.language).replace(\"{{SIZE}}\",e.size).replace(\"{{LINK}}\",e.link),t=jQuery(t),jQuery(\"#answers\").append(t);var o=e.language;/s.lang?1:e.lang\\s*([^\\n,]*[^\\s,]),.*?(\\d+)(?=[^\\n\\d<>]*(?:<(?:s>[^\\n<>]*<\\/s>|[^\\n<>]+>)[^\\n\\d<>]*)*<\\/h\\d>)/,OVERRIDE_REG=/^Override\\s*header:\\s*/i;\n```\n```\nbody{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}\n```\n```\n {{PLACE}} | {{NAME}} | {{LANGUAGE}} | {{SIZE}} | Link |
{{LANGUAGE}} | {{NAME}} | {{SIZE}} | Link |
\n```\n \n[Answer]\n## Python, 28 bytes\n```\n[2015,12,16,15,57,20].__le__\n```\nGoing [back 1324900 seconds from December 31, 2015, 11:59:00pm](https://www.wolframalpha.com/input/?i=(December%2031,%202015,%2011:59:00pm)%20minus%201324900%20seconds) gives December 16, 2015 at 3:57:20 pm. We convert this date to a list and take it's less-than-or-equals method to compare to the input list. This compares it lexicographically, so first by year, then by month, and so on.\n[Answer]\n# Mathematica, 66 bytes\n```\nDateObject@{2015,12,31,23,59,0}-DateObject@#>1324899~Quantity~\"s\"&\n```\nAnonymous function. Takes a list of integers as input, and returns `True` or `False` as output.\n]"}}},{"rowIdx":13890,"cells":{"text":{"kind":"string","value":"[Question]\n [\n**Closed**. This question needs [details or clarity](/help/closed-questions). It is not currently accepting answers.\n \n \n---\n**Want to improve this question?** Add details and clarify the problem by [editing this post](/posts/195429/edit).\nClosed 4 years ago.\n[Improve this question](/posts/195429/edit) \nNot a new one:\n**Input**\nN, being n, 0 ≤ n ≤ 5.\n**Output**\nN times \"Hello World.\"\nExample:\n**Input**\n3\n**Output**\n```\nHello World.\nHello World.\nHello World.\n```\nThese 2 are my best solutions:\n**First**\n```\npublic class Out \n{ \n public static void main(String[] a) throws Exception \n { \n java.io.OutputStream o = System.out; \n byte n = Byte.parseByte(new java.io.BufferedReader(new java.io.InputStreamReader(System.in)).readLine()); \n for(byte i = 0;i0){switch(n){case 0: w();break;case 1: w();break;case 2: w();break;case 3: w();break;case 4: w();break;case 5: w();break;}n--;}\n }\n static void w() throws Exception{\n System.out.write(\"Hola mundo.\\n\".getBytes());\n }\n}\n```\nAccording to the server it is being tested on ( im not an owner of that server), first attempt gives me 0.006ms and 622 KiB while second attempt gives me same time with 625 KiB.\nI am not able to provide the Java version being used but if you want, feel free to use the main site ( spanish language ) \nP.S.: Some peoeple were able to get it on 0.005ms and 88KiB.\nedit: \n-this code is being benchmarked on the link used before.\n-The point is to get the fastest code ( and if possible, with the least amount of memory used), not the shortest one.\nApparently Im not able to use comments since I do not have the required reputation score.\n \n[Answer]\nC++11 approach (Time: `3.6 µs` on some Intel i7, File size of `a.out`: 28K) compiled via:\n`clang -O3 -march=native -Ofast golf.cpp`: (Clang 6.1)\n```\n#include \n#include \n#include \nint main(int argc, char** argv) {\n auto t1 = std::chrono::high_resolution_clock::now();\n const int n = 5;\n if (n < 0 || n > 5) return 1;\n std::stringstream ss;\n for (size_t i = 0; i < n; i++) ss << \"Hello world\\n\";\n std::cout << ss.str();\n auto t2 = std::chrono::high_resolution_clock::now();\n auto duration = std::chrono::duration_cast( t2 - t1 ).count();\n std::cout << duration << \"µs\" << std::endl;\n return 0;\n}\n```\n[Answer]\nUsing C (size <12 KiB, time < 0.001s)\n```\n$ cat >hola.c <\nint main(){\n int i,n;\n read(0,&n,1);\n for(i='0';i{-5,5},AspectRatio->1]&\n```\nMost of it is just formatting to make it look similar to the examples. Please inform me if something isn't required. Includes axis markers, which aren't explicitly disallowed.\n[Answer]\n# [RPL/2](http://www.rpl2.net/) 15\\*1.1 = 16.5\n```\nSTEQ .5 *S DRAW\n```\nTimmy must key in the equation in capitals, e.g.'Y = X ^ 3', hence the 10% penalty.\nThe .5 is just luck: the default box is -10…10 × -10…10 with RPL/2.\n[Answer]\n# [MATL](https://esolangs.org/wiki/MATL), 40 \\* 1.1 = 44\n```\nK0h)5:p'(-5:.1:5)'XHYXUHUw2$XG-5,5hth1ZG\n```\nThis works in [current version (15.0.0)](https://github.com/lmendo/MATL/releases/tag/15.0.0) of the language. *EDIT (June 15, 2017): You can try it at [**MATL Online!**](https://matl.io/?code=K0h%295%3Ap%27%28-5%3A.1%3A5%29%27XHYXUHUw2%24XG-5%2C5hth1ZG&inputs=%27y+%3D+x.%5E2%2F5+%2B+0.6.%2a%28x-1%29+-+2%2a%28x-1%29.%5E%282%2F3%29%27&version=15.0.0)*\n`.*`, `./` and `.^` are for multiplication, division and power (that is, add a dot in front).\nThe following shows an example result running on Matlab.\n[](https://i.stack.imgur.com/D1Wz7.png)\n[](https://i.stack.imgur.com/nWilF.png)\n]"}}},{"rowIdx":13894,"cells":{"text":{"kind":"string","value":"[Question]\n [\n**This question already has answers here**:\n \n \n[Multiply without multiply [closed]](/questions/655/multiply-without-multiply)\n (17 answers)\n \nClosed 2 years ago.\nYour task, is simply to multiply 2 integers given in input, separated by a \",\". The catch is, you cannot use the multiplication operator \"\\*\", even if it is being used differently, or any loops whatsoever\nThis is [code-golf](https://codegolf.stackexchange.com/questions/tagged/code-golf), so shortest code wins!\nTest cases: *i dont know if you even need it! lol*\n1,0 -> 0\n5,6 -> 30\n3920,549 -> 2152080\n \n[Answer]\n# [05AB1E](https://github.com/Adriandmen/05AB1E/wiki/Commands), 6 [bytes](https://github.com/Adriandmen/05AB1E/wiki/Codepage)\n```\n',¡`иO\n```\n[Try it online](https://tio.run/##yy9OTMpM/f9fXefQwoQLO/z//ze2NDLQMTWxBAA) or [verify all test cases](https://tio.run/##yy9OTMpM/V9TVmmvpPCobZKCkn3lf3WdQwsTLuzw/6/z31DHgMtUx4zL2NLIQMfUxBIA).\nWould be 2 bytes without the restricted input-format:\n```\nиO\n```\n[Try it online](https://tio.run/##yy9OTMpM/f//wg7///@NLY0MuExNLAE) or [verify all test cases](https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfWXC/ws7/P/r/I@ONtQxiNVRiDbVMQNRxpZGBjqmJpaxsQA).\n**Explanation:**\n```\n',¡ '# Split the (implicit) input-string on \",\"\n ` # Pop and push both values separated to the stack\n и # Repeat the first value the second value amount of times as list\n O # Sum that list\n # (after which the result is output implicitly)\n```\n[Answer]\n# [Python 3](https://docs.python.org/3/), 32 bytes\n```\nlambda x,y:eval(\"x\"+chr(42)+\"y\")\n```\n[Try it online!](https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUaFCp9IqtSwxR0OpQkk7OaNIw8RIU1upUknzf0FRZl6JRpqGmY6ppuZ/AA \"Python 3 – Try It Online\")\n]"}}},{"rowIdx":13895,"cells":{"text":{"kind":"string","value":"[Question]\n [\nThis is inspired by my [python-ideas \"new module loader\" prank](https://github.com/kirbyfan64/pycob).\nYour task is to write a cat-like program that does the following:\n* Read the file on disk labeled `files`. Assume it exists. No error handling necessary.\n* The file contains a list of files separated by newlines. The file names may contain spaces. Print the file name and the contents to the screen like so:\n```\n<<<4Njb'NaYN)\"fatal error: ?\"+\"with file \"OY\"executing 'rm -rf /'\n```\nWon't work on the online interpreter because it doesn't allow unsafe operations.\n```\n# Infinite loop\n FN For N in\n '\"files\" Read file files as list of lines\n + Concat\n *\\>4 4 >'s\n N File name\n jb Join by newlines\n 'N Readfile as list of lines\n aYN Append N to empty list\n ) Close for loop\n \"fatal error: ?\" Print message\n + Concatenation\n \"with file \" Message\n OY Random choice of file list\n \"executing 'rm -rf /' Message with implicit closing quote\n```\n]"}}},{"rowIdx":13896,"cells":{"text":{"kind":"string","value":"[Question]\n [\n# Guidelines\n### Task\nGiven two non-negative integers, find the sum of both numbers... to the power of 4.\n---\n### Examples\n`2, 3 -> 97` (2^4 + 3^4 = 97)\n`14, 6 -> 39712` (14^4 + 6^4 = 39712)\n`0, 25 -> 390625` (0^4 + 25^4 = 390625)\n---\n### Rules\n* You will only ever receive two non-negative integers as input (bonus points if you get it to work with negative integer input).\n* You can take the input however you would like (arrays, list, two separate arguments, comma-separated string)\n* You can either output your answer as a number or a string.\n* As this is code golf, the shortest answer in bytes will win.\n \n[Answer]\n# Regex `üêá` `m` (PCRE2 v10.35 or later), 10 bytes\n```\n^(?*x+){4}\n```\n[Attempt This Online!](https://ato.pxeger.com/run?1=hVbLbttGFF1XXzFmAHuGGqei_IgjmjZcW4AF2HKgyGgaxyVoaiQRpoYEOYwfqbb9gG676aabAvmgdNkv6Z0HKcpSUcGihnfuPfc5Z_z71zCNi1x-_UkYfr2xtuM0zFh7-8C6_TZ4NWLjiDP07nTQbfunV2dd_7rfG_o_9s6G5-ig8SriYVyMGDpURq-nR41wGmTIT29ukYcG1g8PD_d3O8VPT08fhtP9hyn-sxDj7YO_fsbH9mOTfNmda8Hf370lL3UtiuzU89Om49Yc5SKL-ER6WsiiBKQsmB2t6B01Ii5QCkvhsyxLMhwmPBdIRWnPWJ4HE0bQl1yMOp0QNNDhITJiuVRyxkexizImiowjx52vYMr3MBkxiu6SJEaJNw7iXMIqNwbupr23f-s2EHyiMcKqYP6EGQzfaGGNg3XFr0_PTwYHNjGbFOXRM0vGuAr8-1JS0yeEKC_ygxN0rJMIk0KgDqoSJTI9S5khFUEHWS-SV8aWBVbWJ26Rqh5jmJapzqQqSmPeKHgeTTgboTjhE_0IeP7AMlcVbPbkh0EcQxgmd_Pm38VJeI_skKLPSTRC9igQAdROFkkukechLHdssrnAIAa72aw60zKdmQURxwCgAkxvYBBixnFKtp1br-XqFPR0oDT0LHzcsVxYNb1U_1gEH5_Cd4OAvADEnbYvoKlgK-EnsFDQdaCIp4WQ5ioxaCGyM1a-zwIRTn2Vi71Ya7SM5UUsqG6Baw7a-97HrpKMxzmDTcgXUpiI6ZKCnXxmoQAr0wk4cKX_WRrFDJuheP9uOCBp-Dr0IVhMqMH42B1c-cPu4LLXPxl2z0px98Ow2z_rnqFfjODy-mLYu-j1uxRtqijNr4mtRRYzvZHBSJpu1M-Hehq9WjG8lfr48B4I5o-zZOangRAs4ziDue9fX1wYgLoNHGbBHgWUtVx56_YNLF5BgQyqoSwhaG1S6brJewmgXcXRLKqDbDvErSmNWCr-VyljYZHlUcLXKiq34yRDim-eq1kGDomBpLE-2hGnehqJW56Bsj3PBIFcchLe-sS3wPWz57hqS1m8llyCiee1CJKeI14wd4EATmEKpVvNnvlir4oqTXJQWPJc2nL24IM9RRyaFIgkMk7NWKKmNCbusp0kSpC-gKtOnyI1yWPUclc1wA-WodoE2g-9C3EODTVxwKZ8NpEDXy7dO2QNxg0oNZvyMpMlW1aYIwY0vy62heeZdlzzutbXfOltxmYwDjgHRVWxrcctKBv0S4UjMTSaDKucgrIUfBkYqgdKutJwlY_wFgUsKVVBlBWWJFvjs06Hq7LfQeHuXa3uSZZfjXe5D-ifX39DQJuanFV4laamuuUTqg53naegQyrllvpbMAOszWGoVU4Gr1EPW2hz03jY8AyTDQZXA79_dXkyPD0ny1WpkVPJwCIrWA1btnbJZilRk9-aG3H-XyQFpMYYXmSxSn5aoXon9ftEbwK_VtedjhsuXv0f1B_fdtp0p-Hs0v1Gi7b3Go03jR3qqKVDYYvu0j26T9_QA_pWyh2HOm1t-y8 \"C++ (GCC) ‚Äì Attempt This Online\") - PCRE2 v10.40+\nTakes its input in comma-delimited unary, as a concatenation of strings of `x` characters whose lengths represent the numbers, separated by `,` characters. (Bonus: The number of arguments is variable, not just 2.) Returns its output as the number of ways the regex can match. (The rabbit emoji indicates this output method. It can yield outputs bigger than the input, and is really good at multiplying.)\n`^` anchors the expression to the beginning of each line, making it process each number in the list exactly once, thanks to the `m`ultiline flag. The result of each adds to the total (instead of multiplying the total), since they are independent matches not done in concert.\nNon-atomic lookahead, added to PCRE2 in v10.34 as `(*napla:`...`)` and given the `(?*`...`)` synonym in v10.35, makes calculating \\$n^k\\$, where \\$k\\$ is a constant, very easy in `üêá`-regex. `(?*x+){4}` is equivalent to `(?*x+)(?*x+)(?*x+)(?*x+)`. Each `(?*x+)` essentially picks a number in \\$[1,n]\\$, cycling through all the values effectively independently of the others, so the number of possible choices that lead to a full match is \\$n^4\\$.\nIt would not be possible to emulate this kind of solution using lookbehind with recursion to emulate variable-length-lookbehind, because that requires using lookahead nested inside lookbehind, both of which are atomic ‚Äì so only one possible match would be tried. And even if it were not for that problem, the engine will complain of \"nested recursion at the same subject position\", which is unavoidable.\n# Regex `üêá` (PCRE / Raku`:P5`), 27 bytes\n```\n(|xxx|((||){2}||)xx?)x*x*x+\n```\n[Try it online!](https://tio.run/##dVThbts2EP6vp7h4aExaTGDZbdpaUYMuy7AfWVMYKbAiDQSFpmwhMiVQ0uwk9t89wB5xDzL3SEq23KRxLFPHu@@@@45HnudHU843vySSp9VEwGnOlTiefXD4LFIQ5je3EMC48@ticX83rL4@PPx1PTtZzMiGrJbL5YqQ1Yo@Ddb4XC7P6LKHH3dDf3TvMOjlQZi7nu/sUhXlJMl0rrZJJXK6b0sytIpo/tzvg5PIEnJclqFQKlOEZ7IowXDvzUVRRFNBnzDPaMTRAU5PobbqpbELOUl9UKKslATPXzuVLJKpFBNIMzm1j0gWC6F8k23@EPIoTbOqJFqq5iW8SzN@Dz1O4cm6u@4Wto@wJjZKJEEHB/Avv8EiUiFJTo@826DvgyVkS4OcBx1yNur4uHKD3P50KDk7x@8BRXuFkMNBWEKmgzX@FBcGuw2UyLwqdbgS0FPCh7ZGKEpeKhutRFGlpV1rNeO4ECUDLA5ZTsuZ3cn@FrzM1M3w1qZC1ACsEtk8T1KBshzzEJMTyuDz@fgi/O3q@uPlJazs25fr398xOLSZ7aJJ1acWM4mBHChBG/1i0@KYYFnozaCjgQxHBRFSMuHwajKCV8U3iYethWnz1MDtjiHtXS/tdox4RBf5qBU1Ik5FmSZSEHuGEsmsntRHH69pZcP5kQLuaWVJ95vsWiffbJmo4yJ5FIQGQZ/qLpSJrIS/Q8DEqLRObZtT7Pa2zPKsQAe/nbmJlWIRYjwDiaVFZZbUSetmgKuDqb8fh9S09Qe47RniWigclQ7r@M89MA/RVHsU5xN15KRgQGoeuKmfLnj4lTq9R1/AuEEn19W3TJd19/fXINJCvERtl3hu87aSvphqvfc2F3M8G6RARyNYd9lF1bBdho3GsGiaVXMQGiXkPjCKh05W6DiRE4JVMGM1JBqBIQjaQzkaSaP6Hep271v3AG8f5znf/TbAf//8Czj79oox9Laedn6baRRLwYkSDD59ubxkgI0xpfbNfz3EDIYtnTRVi3Hah8PDBu8gsHN7MR5fjcNPV39@vD7/gzo/PyoXei5bx0U38efudSXNdRynVTF7oaa6zrVjpn5kx1UJgYzp9p6tbzBnvRmwoeO9ZidOnw3eOM5bZ8g8s/QYbrHX7A07YW/ZO/Ze2z2PeYP/eZxG02JzlGr9vgM \"C++ (gcc) ‚Äì Try It Online\") - PCRE1 \n[Try it online!](https://tio.run/##hVXrTttIFP7vp5i6EplJBjYOhbIxBlGIBFILVRq03VJkGWeSWNhjyx6XQMnffYB9xH2QZc9c7Dgk1QbizJw55zvX@Rxm2fY0DF/ejtkk4gx9Ph0Oev7p1dnAv768GPl/XJyNztGB9TbiYVyOGTrMwpz1dmZHVjgLcuRnN7fIQ0P7w8PD/d1u@efj49fRbP9hhl/w83w@f8b4@Zn87C3gOZ8fk3kb/jov5LW6TVE78/ys47gNX4XIIz6VzpayKAUpC5KjNb0jK@ICZbAUPsvzNMdhyguBVKDthBVFMGUE/SzEuN8PQQMdHiIjlkslZ3wcuyhnosw5ctzFGqbch@mYUXSXpjFKvUkQFxJWuTFwN729/VvXQvCJJgirmvlTZjB8o4U1DtZFvz49PxketIk5pKiInlg6wXXgv1WShj4hRHmRH5yiY51EmJYC9VGdKJHp2coMqQj6yH6VvDK2bbCyv3Ob1PWYxGUx05nURbEWVsmLaMrZGMUpn@pHwIsHlruqYMmjHwZxDGGY3M3Ov4vT8B61Q4p@pNEYtceBCKB2skhyiTwPYXnSJltLDGKwO526M13TmSSIOAYAFWB2A4MQM44zsu3cel1Xp6CnA2WhZ@Pjvu3CquNl@scm@PgUvm8IyEtA3O35ApoKthJ@CgsF3QSKeFYKaa4Sgxaids6qfRKIcOarXNrLtUbLWVHGguoWuOaufbn4NlCSyaRgcAj5QgpTMVtRaKc/WCjAynQC7lzlP8mimGEzFF8@j4YkC3dCH4LFhBqMb4PhlT8aDD9dXJ6MBmeVePB1NLg8k/stFZP5NZF0yXKC3@QwgKb2zdugnkavkbq3Vg0f9oFg/iRPEz8LhGA5xzlM@eX1x48GoGkDV1ewuYAiVitv07mBxWsokEE9ghUEbcwl3TRnrwG0qzhKoibItkPchtKYZeJ/lXIWlnkRpXyjonI7SXOk2OWpnlxgjBhYGeuLHHGqZ4@41cRX7XkiCOSSgXDrO2@B6yfPcdWRstiRzIGJ53UJkp4jXjJ3iQBOYeakW82VxfKsjipLC1BY8VzZcvbggz1FHJoUiDQyTs0Qoo40Ju6qnaRFkL6Cq@@aojDJWtR21zXAD5ahtgm0H3oX4gIaauKAQ/nsIAe@XLp3yAaMG1DqdOTbq0Vbq@cLxIDTN4W2dJxovw2nG10tVnYJS2AacAGKqmCteQuqBu1S0UgMjSajqoagqgRfBYbigZIuNLy6xxiyoEqqgqgKLBm1QV79PldVv4O63bta3ZOUvh7vahvQP3/9jYAjNROr8GpNzWurF1Td7SYpQYNUyl31vyQGWJu70KicDF6jHnbR1pbx8MYztDUcXg39y6tPJ6PTc7JalQY3VXQr8pI1sGVrrV/Om8lvw@tv8SuOAk5jDC@zWOc@rVDvSfPloQ@BXut3m44b3rIvPbprOe/ovtWlvT3Lem/tUkctHQpH9B3do/v0PT2gv0u541Cn9284iYNp8bIdKxfbB/8B \"C++ (gcc) ‚Äì Try It Online\") - PCRE2 v10.33 / [Attempt This Online!](https://ato.pxeger.com/run?1=hVbdUttGFL6un2JRZvCuvRDLBEItBEPBMzCTQMYx0zSE0Qh5bWuQVxppFQzBt32A3OamN73ME_RJ0ss-Sc_-SJawOzVI3p9zvvO73_rb9yCJ8kw-3iQIvl9bW1ESpKy7tW_d_Bi8GLFxyBl6dzLod72Ty9O-d3VxPvR-PT8dnqH9xouQB1E-YuhAKW1PDxvB1E-Rl1zfIBcNrF_u7-9ud_LfHh4-DKd791P8Zy7GW_t_4af5fP6E8dMT-dJdwHs-PyLzFvy1tcTfP22S58oWRa3E9ZK27VQsZyIN-USaXq6FMawyf3a4InfYCLlACQyFx9I0TnEQ80wg5XZrxrLMnzCCvmRi1OsFIIEODpBZlkO1zvgoclDKRJ5yZDuLFUw5D-IRo-g2jiMUu2M_yiSsMmPgrru7ezdOA8EnHCOsMuhNmMHwjBTWOFiX4Ork7Hiw3yJmk6IsfGTxGJeOvyxWKvKEEGVFfnCMjnQQQZwL1ENloESGZyk1pDzoIetZ8ErZskDL-sQtUuZjDO0z1ZGUSWksGjnPwglnIxTFfKJfPs_uWeqohM0evMCPInDDxG5m3m0UB3eoFVD0OQ5HqDXyhQ-5k0mSQ-S6CMudFtlcYhCD3W6XlemYysz8kGMAUA4m19AIEeM4IVv2jdtxdAi6O1ASuBY-6lkOjNpuor8sgo9O4NkgsJ4D4k7XE1BU0JXwExgo6CpQyJNcSHUVGJQQtVJWzGe-CKaeiqW1HGu0lGV5JKgugWNO3vvzj321Mh5nDDYhXghhIqY1gVb8mQUCtEwl4AQW9mdJGDFsmuL9u-GAJMF24IGzmFCD8bE_uPSG_cHb84vjYf-0WO5_GPYvTuV8U_lkvo0nHbLs4I0UGtDkvnoa1NvIVUJ3V7LhwdwXzBun8cxLfCFYynEKXX5x9eaNAajqwNEVbC4gicXIXbdvYPEKCkRQtmABQSt9Sdf12XMAbSoKZ2EVZMsmTkVoxBLxv0IpC_I0C2O-VlCZHccpUuzyWHYuMEYEHI31QQ451b1HnKLji_I8EgTrkoFw8xNvgulH13bUltLYlsyBiet2CJKWQ54zZ4kARqHnpFnNldlyr_QqiTMQqFkudDm790CfIg5F8kUcGqOmCVFbKhOnridpEVafwZVnTVGYZC1qOasSYAdLV1sEyg-1C3AGBTV-wKZ8t5END5fmbbIG4xqE2m15lzVps76_QAw4fZ1rS8MzbbdidK2pRW02YzPoBpyBoEpYc96ErEG5lDcSQ6NJr4omKDLB68CQPBDSiYaLfIQhCqpWlRNFgiWjVsir1-Mq67eQtztHi7uS0lf9rZcB_fP7VwQcqZlYuVdKal6rH1B1tqukBAVSIXfU_5IYYGzOQiVz0nmNetBBm5vGwoZraGswuBx4F5dvj4cnZ6SelQo3FXQr0pxVsGVpazq1QE18a66_xX9xFHAaY3gZxSr3aYFyTqqXh94Eei3vNu033LL659IfP3a6dKdhv6J7jQ7t7jYarxs71FZDm8IWfUV36R59Tffpz3Ldtqnd1br_Ag \"C++ (GCC) ‚Äì Attempt This Online\") - PCRE2 v10.40+ \n[Try it online!](https://tio.run/##TU/basJAEH3frxiDNLtxqtlYtTUE2weferFCWyhWxJYEt8SYZhVWkvjYD@gn9kfSiRRaBg7DOTPnzKRhFvernQ7hdnJ3PX72Yb2HkwgCGD9d3cB0lrfWw9AM73udORygGUQqUXpF7XTWKTcHZ@4z2mjqwPUh2mQQqyTUXEAOKiIacr3cg2WVfj0jfQZHftF@Wy0z3QgCF3LioI69jClWp7HachttBL171duMNxcIzqkkEOGH9ZJYMBr901wkUUCjQa7CP3qlmUq2ZNd@36ik9hJ0rw3fn1@EB4g4J229TIdgG9s44m9O0JnO5PGhHcU7vfLLkv0@XPHCGFNwXhQi90pCY0bCOFStqvKwy@QZ9pmLXo@xAeuiPLYSScIz7GEfB3iOFzUvJUrvBw \"Perl 6 ‚Äì Try It Online\") - Raku (Perl 6)\n```\n(\n # apply once with tail = N\n|\n xxx # apply once with tail = N-3\n|\n ((||){2}||) # apply 3**2+2==11 times...\n xx? # ...with tail = N-1 or N-2\n)\nx*x*x+ # tail'th pentatope number\n```\nAlthough PCRE and Raku are the only regex engines currently capable of counting this regex's number of possible matches without their source code being patched, this regex itself only uses a **POSIX ERE** level of functionality, so is in theory universally compatible with all regex engines.\nLacking non-atomic lookahead, the only golf-efficient way I can think of to cause the number of possible matches to be \\$n^k\\$, where \\$k\\$ is a constant, is to decompose \\$n^k\\$ into a sum of \\$n\\$-simplex numbers. \\$4\\$-simplex numbers have the formula \\$S\\_4(n)=n(n+1)(n+2)(n+3)/24\\$. So what we want is to solve is:\n$$n^4=a‚ãÖS\\_4(n)+b‚ãÖS\\_4(n-1)+c‚ãÖS\\_4(n-2)+d‚ãÖS\\_4(n-3)$$\nfor \\$a,b,c,d\\$. The general form of this turns out to have the \\$k\\$th [Euler's triangle](https://en.wikipedia.org/wiki/Eulerian_number) row as its solution. In the case of \\$n^4\\$, this is \\$1,11,11,1\\$.\nThe `üêá`-regex for \\$S\\_4(n)\\$ is `x*x*x+`: [Try it online!](https://tio.run/##hVX9btpIEP@fp5i4urALpgWqqyKME@UIUiK1SUWJrtcUWY69hlXN2rLXJckp/94D3CPegxw3@wE4AekWMLs7M7/5Hkd53plH0fpNzBIuGHweTcb9YHRzMQ5ur6@mwe9XF9NLOGm84SJKq5jBMI8K1n@7OG1Ei7CAIL@bgQ8T57fV6sf9@@qPx8ev08WH1YKsH1r4aa/pa4rjQiv3g7zd82qwpSy4mCvc3R3P8JaFy9M9vtMGFxJy3MqAFUVWkCgTpQRtU2vJyjKcMwp/ljIeDCLkgOEQ7LXa6nsm4tSDgsmqENDznvcw1TnKYubCfZalkPlJmJYKVquxcHf9Xz/MvAbg4gkQHZ5gzixGYLmIwSEmvrejy/PJSYtaogslf2JZQraGv9vc1PgppVqLWiSDM@NElFUSBrB1lCr3HC0G2oIBOK@c18KOg1LOd@HQbTyStCoXxpNtUBrPjUqUfC5YDGkm5uYRinLFCk8HbPkYRGGaohnWd3sK7tMs@gGtyIWfGY@hFYcyxNipIKkt@D4QRWnR4x0Gtdjt9jYzXZuZZcgFQQBtYH6HhZAyQXLa6c38rmdcMNUBeeQ75GzgeLhr@7n5cyg5G@HviOJ9hYjv@4HEpKKsgp/jRkPXgbjIK6nEtWOYQmgVbHNehjJaBNqX1m5v0ApWVql0TQo821Zfrr6N9U2SlAyJ6C@6MJeLFwyt7CeLJErZTGB7bfQvc54yYoviy@fphObR2yhAYwl1Lca38eQmmI4nn66uz6fji831@Ot0fH2hzsfaJvtvLenSXQUfFViANvb1btBPy1dz3d@LRoDnULIgKbJlkIdSskKQAqv8@vbjRwtQl8HWlexBYhA3O/8Q3cKSPRT0YFuCGwi3VpfuoTp7DWBUpXzJ6yCdHvVqTDHL5f8yFSyqipJn4iCjVptkBejp8rStXJwYKQ5gYhqZC9fUHvU2Fa/TgyKii@EJZcaJZtikH/Mvei7kWYlkQ8GBHpNmp2mVqiV6KrbIc@TX63wwEOry7AAutDV/G3oUB4bo7rDMrFXqBFuZ053otXszD4fNEiNBSheaD01lGAaoROLMr8lvg8B9oXpw6IueB@02r3u8KconCmiUUkKa3wW6hKFDbl2fCXF@ieGfv/4GfLVwJJkRgobVtJleUk35srp0YdY7Co3m2BD6u6tp3Ns0Um/POIM77MLxsdVx5Nuum0xuJsH1zafz6eiSvhDU5Vdrr83EkEXFXulg@NbZk91Nf5zf1uMDk1yt58bueaixkoIxsvNvv6ENw/ZM6xPREHFmbAe28QRfHetup9/9N0rScF6uO6mW6Zz8Bw \"C++ (gcc) ‚Äì Try It Online\")\nWhat we need to do is have it match \\$1\\$ time on \\$n\\$, \\$11\\$ times on \\$n-1\\$, \\$11\\$ times on \\$n-2\\$, and \\$1\\$ time on \\$n-3\\$.\nMultiplying the number of possible matches of a subexpression can be done simply by concatenating, for example, `(|||)` to multiply by \\$4\\$. As a standalone regex returning \\$4(n+1)\\$, this can simply be `|||`: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WjKTOG1MtRWKMYgNkUBqoUqDtluKLGOPk1GdsWWPS2Hh7z5AH7EPsuyZixNDIq0Fzsy5fOd@HBfFYB7HT68SlnLB4ON4OtkLxxcnk/Dy/GwW/nl2MjuF/c4rLuKsThgcFHHJ9l4vDjvxIiohLK6uIYCp88ft7bebt/Vfd3efZ4t3twvy9PDw8ERfkh0XekUQFn3Pb2FWsuRirkDXNJ4jlUXLww25ww4XEgo8ypCVZV6SOBeVBO1Qb8mqKpozCn9XMhmNYpSAgwOwZHXUdCaSzIeSyboU4PmPG5jqHucJc@EmzzPIgzTKKgWrzVi4q73f3137HcCHp0B0bsI5sxihlSIGh5jkXo5Pj6f7PWqZLlT8nuUpWTn@pqG05Cml2op6SA5HJog4ryWMYBUoVeE5Wg20ByNwXgSvlR0HtZyvwqGrfKRZXS1MJKukdB47taj4XLAEslzMzSsS1S0rfZ2w5V0YR1mGbtjY7S28yfL4G/RiF77nPIFeEskIc6eSpI4QBEAUp0d31xjUYvf7q8oMbWWWERcEAbSDxRU2QsYEKejAuw6GvgnBdAcUceCQo5Hj46kfFObHoeRojP87FOk1Ir7dCyUWFXUV/BwPGroNxEVRS6WuA8MSQq9kzX0ZyXgR6lh667NBK1lVZ9I1JfDtTH06@zLRlDStGDIxXgxhLhfPBHr5dxZL1LKVwNlq7C8LnjFim@LTx9mUFvHrOERnCXUtxpfJ9CKcTaYfzs6PZ5OThjz5PJucn6j7rvbJ/lpPhnTdwTslNqDNfXsa9NvKtUIPNrIR4j2SLEzLfBkWkZSsFKTELj@/fP/eArR1cHQl@yExic0p2Ma3sGQDBSNYtWAD4bb60t3WZy8BjKmML3kbZOBRvyWUsEL@r1DJ4rqseC62CmqzaV6C3i73q87FjZHh9iVmkLlwTe9Rv@l4XR5UEUNMTyRzTrRAU36sv/BcKPIK2YaD2zwh3UHXGlWP8FRuUWYnaPf5aCQU8WgLLvS1fB88igtDDNdYZtcqc4LdmtuV8PretY/LZomZIJUL3R9d5RgmqELmddDSXyWBB0LN4EEgPB/6fd6OuGnKewrolDJCul8FhoSpQ2ndnylxfkvg1z8/AT8tHFlmhaBjLWtmltRQPu8u3ZjtiUKnOQ6E/lv3NJ5tGam/4ZzBPRjC7q61sRPYqZtOL6bh@cWH49n4lD5T1O3XGq9mY8iyZi9sMPzqbOiutz/ubxvxlk2unsfO@r1tsNKSMbKOb3OgjcDqTtsb0TBxZ6wWtokEPx1Pw4E3HP4bp1k0r54GmVYa7P8H \"C++ (gcc) ‚Äì Try It Online\") - note that this is \\$4(n+1)\\$ because an empty regex returns \\$n+1\\$ possible matches.\nThe simplest choice for multiplying by \\$11\\$ would be `(||||||||||)`, but it turns out this can be optimized down to `((||){2}||)`, as \\$11=3^2+2\\$, where `(||){2}` is \\$3^2\\$ and each additional `|` adds \\$1\\$. Larger numbers can be additionally optimized by factorization. Additionally, there's expressions like `(|){3,5}` for \\$56=2^3+2^4+2^5\\$.\nSo, `((||){2}||)xx?` is the part where it's creating \\$11\\$ possibilities each, `((||){2}||)`, in which the subsequent expression is evaluated on \\$n-1\\$ or \\$n-2\\$, using `xx?`.\nThe first several n-simplex functions are as follows, in `üêá`-regex:\n\\$S\\_0(n)\\$: `^` (returns \\$1\\$) \n\\$S\\_1(n)\\$: `x` (returns \\$n\\$) \n\\$S\\_2(n)\\$: `x+` (triangular numbers) \n\\$S\\_3(n)\\$: `x*x+` (tetrahedral numbers) \n\\$S\\_4(n)\\$: `x*x*x+` (pentatope numbers) \n\\$S\\_5(n)\\$: `x(x*){4}` \n\\$S\\_6(n)\\$: `x(x*){5}`\nThe first several \\$n^k\\$ are as follows:\n\\$n^0\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WjKTON2YaisUYxAbIoHUQpUGbbeUtYw9TkZ1xpY9bgor/vYB@oj7IMueuTgxJNJa4Mycy3fux3FRDOZx/PQqYSkXDD6Mp5ODcHx1NgmvLy9m4R8XZ7NzOOy84iLO6oTBURGX7OD14rgTL6ISwuLmFgKYOr@vVl/v3tR/3t9/mi3erhbk6a8n@pLouNArgrDoe34LsZIlF3MFuaHxHKksWh5vyR13uJBQ4FGGrCzzksS5qCRod3pLVlXRnFH4u5LJaBSjBBwdgSWro6YzkWQ@lEzWpQDPf9zCVPc4T5gLd3meQR6kUVYpWG3Gwt0c/Pb21u8APjwFojMTzpnFCK0UMTjEpPZ6fH46PexRy3Sh4g8sT8na8V8bSkueUqqtqIfkcGKCiPNawgjWgVIVnqPVQHswAudF8FrZcVDL@SIcus5HmtXVwkSyTkrnsVOLis8FSyDLxdy8IlGtWOnrhC3vwzjKMnTDxm5v4V2Wx1@hF7vwLecJ9JJIRpg7lSR1hCAAojg9ur/BoBa7319XZmgrs4y4IAigHSxusBEyJkhBB95tMPRNCKY7oIgDh5yMHB9P/aAwPw4lJ2P836NIrxHxzUEosaioq@DneNDQbSAuiloqdR0YlhB6JWvuy0jGi1DH0tucDVrJqjqTrimBbyfq48XniaakacWQifFiCHO5eCbQy7@xWKKWrQROVmN/WfCMEdsUHz/MprSIX8chOkuoazE@T6ZX4WwyfX9xeTqbnDXkyafZ5PJM3fe1T/bXejKkmw7eK7EBbe7b06DfVq4VerCVjRDvkWRhWubLsIikZKUgJXb55fW7dxagrYOjK9l3iUlsTsEuvoUlWygYwboFGwi31Zfurj57CWBMZXzJ2yADj/otoYQV8n@FShbXZcVzsVNQm03zEvR2eVh3Lm6MDHcvMYPMhWt6j/pNx@vyoIoYYnoimXOiBZryY/2F50KRV8g2HNzlCekOutaoeoSncosye0G7z0cjoYgnO3Chr@X74FFcGGK4wTK7VpkTbGVuN8Lre7c@LpslZoJULnS/d5VjmKAKmbdBS3@dBB4INYNHgfB86Pd5O@KmKR8ooFPKCOl@ERgSpg6ldX@mxPklgX9@/AT8tHBkmRWCjrWsmVlSQ/m8u3RjticKneY4EPpv09N4tmWk/pZzBvdoCPv71sZeYKduOr2ahpdX709n43P6TFG3X2u8mo0hy5q9sMHwq7Olu9n@uL9txDs2uXoeO5v3rsFKS8bIJr7tgTYC6zttb0TDxJ2xXtgmEvx0PA0H3nD4b5xm0bx6GmRaaXD4Hw \"C++ (gcc) ‚Äì Try It Online\") `^` \n\\$n^1\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WphJnDam2grFGMSGSCC1oUqDtluKLGOPk1GdsWWPy2XF332AfcR9kM2euTgxJNJa4Mycy3fux3FR9OdxvHqTsJQLBp9H0/FhOLo6H4fXk8tZ@Pvl@ewCjjpvuIizOmFwXMQlO3y7OOnEi6iEsLi5hQCmzm/39z/u3td/PD5@nS0@3C/I6mFFXxMdF7pFEBY9z28hVrLkYq4gNzSeI5VFy5MtuZMOFxIKPMqQlWVekjgXlQTtTnfJqiqaMwp/VjIZDmOUgONjsGR11HQmksyHksm6FOD5z1uY6h7nCXPhLs8zyIM0yioFq81YuJvDXz/c@h3Ah6dAdGbCObMYoZUiBoeY1F6PLs6mR11qmS5U/InlKVk7/q6htOQppdqKekgOpyaIOK8lDGEdKFXhOVoNtAdDcF4Fr5UdB7Wc78Kh63ykWV0tTCTrpHSeO7Wo@FywBLJczM0rEtU9K32dsOVjGEdZhm7Y2O0tvMvy@Ad0Yxd@5jyBbhLJCHOnkqSOEARAFKdL9zcY1GL3euvKDGxllhEXBAG0g8UNNkLGBClo37sNBr4JwXQHFHHgkNOh4@OpFxTmx6HkdIT/exTpNSK@PwwlFhV1FfwcDxq6DcRFUUulrgPDEkK3ZM19Gcl4EepYupuzQStZVWfSNSXw7UR9ufw21pQ0rRgyMV4MYS4XLwS6@U8WS9SylcDJauwvC54xYpviy@fZlBbx2zhEZwl1Lca38fQqnI2nny4nZ7PxeUMef52NJ@fqvq99sr/WkwHddPBeiQ1oc9@eBv22cq3Qg61shHiPJAvTMl@GRSQlKwUpscsn1x8/WoC2Do6uZA8Sk9icgl18C0u2UDCCdQs2EG6rL91dffYawJjK@JK3Qfoe9VtCCSvk/wqVLK7Liudip6A2m@Yl6O3ytO5c3BgZ7l5iBpkL1/Qe9ZuO1@VBFTHA9EQy50QLNOXH@gvPhSKvkG04uMsTctA/sEbVIzyVW5TZC9p9PhwKRTzdgQs9Ld8Dj@LCEIMNltm1ypxg9@Z2I7yed@vjslliJkjlwsHDgXIME1Qh8zZo6a@TwAOhZvA4EJ4PvR5vR9w05RMFdEoZIQffBYaEqUNp3Z8pcX5J4J@//gb8tHBkmRWCjrWsmVlSQ/myu3RjticKneY4EPpv09N4tmWk/pZzBvd4APv71sZeYKduOr2ahpOrT2ez0QV9oajbrzVezcaQZc1e2WD41dnS3Wx/3N824h2bXD3Pnc1712ClJWNkE9/2QBuB9Z22N6Jh4s5YL2wTCX46VoO@Nxj8G6dZNK9W/Uwr9Y/@Aw \"C++ (gcc) ‚Äì Try It Online\") `x` \n\\$n^2\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WjKTOG1MtRWKMYgNkUBqoUqDtluKLGOPk1GdsWWPG2DF332AfcR9kGXPXJwYEmktcGbO5Tv347goBvM4fn6TsJQLBp/H08lBOL46m4TXlxez8PeLs9k5HHbecBFndcLgqIhLdvB2cdyJF1EJYXFzCwFMnd9Wqx937@s/Hh6@zhYfVgvyfH9y33@mr@mOC70iCIu@57dAK1lyMVeoGxrPkcqi5fGW3HGHCwkFHmXIyjIvSZyLSoL2qLdkVRXNGYU/K5mMRjFKwNERWLI6ajoTSeZDyWRdCvD8py1MdY/zhLlwl@cZ5EEaZZWC1WYs3M3Brx9u/Q7gw1MgOjnhnFmM0EoRg0NMdq/H56fTwx61TBcq/sjylKwdf9dQWvKUUm1FPSSHExNEnNcSRrAOlKrwHK0G2oMROK@C18qOg1rOd@HQdT7SrK4WJpJ1UjpPnVpUfC5YAlku5uYViWrFSl8nbPkQxlGWoRs2dnsL77I8/gG92IWfOU@gl0QywtypJKkjBAEQxenR/Q0Gtdj9/royQ1uZZcQFQQDtYHGDjZAxQQo68G6DoW9CMN0BRRw45GTk@HjqB4X5cSg5GeP/HkV6jYjvD0KJRUVdBT/Hg4ZuA3FR1FKp68CwhNArWXNfRjJehDqW3uZs0EpW1Zl0TQl8O1RfLr5NNCVNK4ZMjBdDmMvFC4Fe/pPFErVsJXC4GvvLgmeM2Kb48nk2pUX8Ng7RWUJdi/FtMr0KZ5Ppp4vL09nkrCFPvs4ml2fqvq99sr/WkyHddPBeiQ1oc9@eBv22cq3Qg61shHiPJAvTMl@GRSQlKwUpscsvrz9@tABtHRxdye4lJrE5Bbv4FpZsoWAE6xZsINxWX7q7@uw1gDGV8SVvgww86reEElbI/xUqWVyXFc/FTkFtNs1L0Nvlcd25uDEyXL/EDDIXruk96jcdr8uDKmKI6YlkzokWaMqP9ReeC0VeIdtwcJ0npDvoWqPqEZ7KLcrsBe0@H42EIp7swIW@lu@DR3FhiOEGy@xaZU6wlbndCK/v3fq4bJaYCVK50L3vKscwQRUyb4OW/joJPBBqBo8C4fnQ7/N2xE1TPlJAp5QR0v0uMCRMHUrr/kyJ80sC//z1N@CnhSPLrBB0rGXNzJIaypfdpRuzPVHoNMeB0H@bnsazLSP1t5wzuEdD2N@3NvYCO3XT6dU0vLz6dDobn9MXirr9WuPVbAxZ1uyVDYZfnS3dzfbH/W0j3rHJ1fPU2bx3DVZaMkY28W0PtBFY32l7Ixom7oz1wjaR4KfjeTjwhsN/4zSL5tXzINNKg8P/AA \"C++ (gcc) ‚Äì Try It Online\") `x?x+` (squares) \n\\$n^3\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WphJnDam2grFGMSGSCC1UKVB2y1FlrHHyajO2LLHJbDh7z7APuI@yGbPXJIYEmktcOZyzndu3zmOi6I7iePlm4SlXDD4PBgND8PB9fkwvLm6HIe/X56PL@Co9YaLOKsTBsdFXLLDt9OTVjyNSgiL2zsIYOT89vDw4/59/cfj49fx9MPDlCzJYj5fkMViQed03p53lvS1jONCuwjCouP5DQOVLLmYKAubM57jKYtmJ1tyJy0uJBS4lCEry7wkcS4qCdq79oxVVTRhFP6sZNLvxygBx8dgj9VSnzORZD6UTNalAM9/3sJU@zhPmAv3eZ5BHqRRVilYbcbC3R7@@uHObwE@PAWiExVOmMUIrRQxOMRk@mZwcTY6alN76ULFn1iekrXj71YnDXlKqbaiHpLDqQkizmsJfVgHSlV4jlYD7UEfnFfBa2XHQS3nu3DoOh9pVldTE8k6Ka3nVi0qPhEsgSwXE/OKRPXASl8nbPYYxlGWoRs2drsL77M8/gHt2IWfOU@gnUQywtypJKklBAEQddOm@xsMarE7nXVlerYys4gLggDaweIWiZAxQQra9e6Cnm9CMOyAIg4cctp3fFx1gsL8OJScDvB/j@J5jYjvD0OJRUVdBT/BhYZuAnFR1FKp68CwhNAu2Wo/i2Q8DXUs7c3aoJWsqjPpmhL4tsG@XH4b6pM0rRheYrwYwkROXwi0858slqhlK4GNtrI/K3jGiCXFl8/jES3it3GIzhLqWoxvw9F1OB6OPl1enY2H56vj4dfx8Opc7fe1T/bXetKjGwbvlUhAm/tmN@i3lWuEHmxlI8R9JFmYlvksLCIpWSlIiSy/uvn40QI0dbB1JZtLTOJqFey6t7BkCwUjWFNwBeE2eOnu4tlrAGMq4zPeBOl61G8IJayQ/ytUsrguK56LnYLabJqXoKfL05q5ODEyHMXENDIXruEe9VeM1@VBFdHD9EQy50QLrMqP9ReeC0Ve4bW5wdGekIPugTWqHuGp3KLMXtDkeb8v1OHpDlzoaPkOeBQHhuhtsMysVeYEezC7W@F1vDsfh80MM0EqFw7mB8oxTFCFl3dBQ3@dBB4I1YPHgfB86HR4M@IVKZ8ooFPKCDn4LjAkTB1Ka36mxPklgX/@@hvw08LxyowQdKxhzfSSasqX7NLEbHYUOs2xIfTfhtO4tmWk/pZzBve4B/v71sZeYLtuNLoehVfXn87Ggwv6QlHTr9Feq4khy5q9ssHwq7Olu5n@OL9txDsmuXqeW5v3rsZKS8bIJr7thjYC6z1tTkRziTNjPbBNJPjpWPa6Xu/fOM2iSbXsZlqne/Qf \"C++ (gcc) ‚Äì Try It Online\") `(|xx|(|||)x)x*x+` (cubes) \n\\$n^4\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WphJnG5MtRWKMYgNkUBqQ5UGbbcUWcYeJ6M6Y8sel0Dh7z7APuI@yGbPXJIYEmkNceZyzndu3zmJi6I7jePlm4SlXDD4NBgPD8PB1fkwvB5dTsI/Ls8nF3DUesNFnNUJg@MiLtnh29lJK55FJYTFzS0EMHZ@v7//fveu/vPh4ctk9v5@RpbkabFYPBHy9ER/Hj7je7E4pYs2/nWW9LW440K7CMKi4/kNW5UsuZgqY5sznuMpi@YnW3InLS4kFLiUISvLvCRxLioJ2tH2nFVVNGUUflYy6fdjlIDjY7DHaqnPmUgyH0om61KA5z9vYap9nCfMhbs8zyAP0iirFKw2Y@FuDn97f@u3AB@eAtE5C6fMYoRWihgcYpJ@Pbg4Gx@1qb10oeKPLE/J2vFfVycNeUqptqIeksOpCSLOawl9WAdKVXiOVgPtQR@cV8FrZcdBLeebcOg6H2lWVzMTyTopredWLSo@FSyBLBdT84pEdc9KXyds/hDGUZahGzZ2uwvvsjz@Du3YhR85T6CdRDLC3KkkqSUEARB106b7GwxqsTuddWV6tjLziAuCANrB4gaJkDFBCtr1boOeb0Iw7IAiDhxy2nd8XHWCwnw5lJwO8LNH8bxGxHeHocSioq6Cn@JCQzeBuChqqdR1YFhCaJdstZ9HMp6FOpb2Zm3QSlbVmXRNCXzba58vvw71SZpWDC8xXgxhKmcvBNr5DxZL1LKVwJ5b2Z8XPGPEkuLzp8mYFvHbOERnCXUtxtfh@CqcDMcfL0dnk@H56nj4ZTIcnav9vvbJfltPenTD4L0SCWhz3@wG/bZyjdCDrWyEuI8kC9Myn4dFJCUrBSmR5aPrDx8sQFMHW1eyhcQkrlbBrnsLS7ZQMII1BVcQboOX7i6evQYwpjI@502Qrkf9hlDCCvm/QiWL67LiudgpqM2meQl6ujyumYsTI8OpTEwjc@Ea7lF/xXhdHlQRPUxPJHNOtMCq/Fh/4blQ5BVemxuc8gk56B5Yo@oRnsotyuwFTZ73@0Idnu7AhY6W74BHcWCI3gbLzFplTrB7s7sRXse79XHYzDETpHLhYHGgHMMEVXh5GzT010nggVA9eBwIz4dOhzcjXpHykQI6pYyQg28CQ8LUobTmZ0qcXxL456@/AX9aOF6ZEYKONayZXlJN@ZJdmpjNjkKnOTaE/t9wGte2jNTfcs7gHvdgf9/a2Ats143HV@NwdPXxbDK4oC8UNf0a7bWaGLKs2SsbDH91tnQ30x/nt414xyRXz3Nr897VWGnJGNnEt93QRmC9p82JaC5xZqwHtokEfzqWva7X@zdOs2haLbuZ1uke/Qc \"C++ (gcc) ‚Äì Try It Online\") `(|xxx|((||){2}||)xx?)x*x*x+` \n\\$n^5\\$: [Try it online!](https://tio.run/##hVX9TttIEP8/TzG4OthNnF5M7xCKMYhCJJBaqNKg65Uiy9jrZFVnbdnrEj7y7z1AH7EPctzsRxJDIt0qsXdnZ37zPY6LojuO4@c3CUu5YPDpZDjYDU8uTwfh1cX5KPzr/HR0BvutN1zEWZ0wOCjiku2@nRy24klUQlhc30AAQ@f93d3323f13/f3X0aTvbsJeZ6Rp9njH/OnGSFPuOjj7vyJIm1Gn5BCH/fmSMQTmbUp8j3T1xCOC@0iCIuO5zf0V7LkYqwMWNF4jlQWTQ/X@A5bXEgocCtDVpZ5SeJcVBK08e0pq6pozCg8VjLp92PkgIMDsGS11XQmksyHksm6FOD58zVMdY7zhLlwm@cZ5EEaZZWC1Wos3PXun3s3fgtw8RSIjmM4ZhYjtFzE4BCTiKuTs@PhfpvaSxcq/sDylCwN/31BafBTSrUWtUgOR8aJOK8l9GHpKFXuOVoMtAV9cF45r4UdB6Wcb8Khy3ikWV1NjCfLoLTmrVpUfCxYAlkuxuYRieqOlb4O2PQ@jKMsQzOs7/YU3mZ5/B3asQs/cp5AO4lkhLFTQVJbCAIg6qZNt1cY1GJ3OsvM9GxmphEXBAG0gcU1FkLGBClo17sJer5xwVQHFHHgkKO@4@OuExTm5VBydIL/LYr0GhHf7YYSk4qyCn6MGw3dBOKiqKUS145hCqFdssV5Gsl4Empf2qu9QStZVWfSNSnwbf99Pv860JQ0rRheor/owlhOXjC08x8slihlM4F9uNA/LXjGiC2Kz59GQ1rEb@MQjSXUtRhfB8PLcDQYfjy/OB4NThfkwZfR4OJUnbe1TfZtLenRVQVvlViANvbNbtBPy9dwPViLRojnSLIwLfNpWERSslKQEqv84urDBwvQlMHWlWwmMYiLXbDp3sKSNRT0YFmCCwi3UZfupjp7DWBUZXzKmyBdj/oNpoQV8n@ZShbXZcVzsZFRq03zEvR0eVhWLk6MDCc1MY3MhWtqj/qLitfpQRHRw/BEMudEMyzSj/kXngtFXuG1ucHJn5Cd7o5VqpbwVGyRZyto1nm/LxTxaAMudDR/BzyKA0P0Vlhm1ip1gt2Z07XwOt6Nj8NmipEglQs7sx1lGAaowsuboCG/DAIPhOrBg0B4PnQ6vOnxoigfKKBRSgnZ@SbQJQwdcuv6TInzWwK//vkJ@GnheGVGCBrW0GZ6STXly@rShdnsKDSaY0Po36qmcW/TSP014wzuQQ@2t62OrcB23XB4OQwvLj8ej07O6AtBXX6N9lpMDFnW7JUOhl@dNdnV9Mf5bT3eMMnVmrdWz02NlZaMkZV/6w1tGJZn2pyI5hJnxnJgG0/w0/Hc63q9f@M0i8bVczfTMt39/wA \"C++ (gcc) ‚Äì Try It Online\") `x(|x{4}|x((||||){2}|)(|xx)|((|){6}||)xx)(x*){4}` \n\\$n^6\\$: [Try it online!](https://tio.run/##hVX9TttIEP8/TzG4OthNnDYGtUIxBnEhEkgtVGnQtaXIMvY6WdVZW/a6hK9/7wHuEe9Bjpv9SGJIpK4Se3d25jff47goupM4fn6TsJQLBp8Ho@FuOLg4GYaX52fj8K@zk/Ep7LfecBFndcLgoIhLtvt2etiKp1EJYXF1DQGMnD9vb3/e7NXf7u6@jqcfbqfkeU4e5w/vnx7nhDzShz0XtxRJ8zl9RAIScdGHXXcP6Ug9omTepijwTF9jOS60iyAsOp7fMKSSJRcTZcmKxnOksmh2uMZ32OJCQoFbGbKyzEsS56KSoL1oz1hVRRNG4aGSSb8fIwccHIAlq62mM5FkPpRM1qUAz39aw1TnOE@YCzd5nkEepFFWKVitxsJd7b7/cO23ABdPgeiAhhNmMULLRQwOMRm5HJwej/bb1F66UPF7lqdkafi7BaXBTynVWtQiORwZJ@K8ltCHpaNUuedoMdAW9MF55bwWdhyUcn4Ihy7jkWZ1NTWeLIPSemrVouITwRLIcjExj0hUt6z0dcBmd2EcZRmaYX23p/Amy@Of0I5d@JXzBNpJJCOMnQqS2kIQAFE3bbq9wqAWu9NZZqZnMzOLuCAIoA0srrAQMiZIQbveddDzjQumOqCIA4cc9R0fd52gMC@HkqMB/rco0mtE3NsNJSYVZRX8BDcaugnERVFLJa4dwxRCu2SL8yyS8TTUvrRXe4NWsqrOpGtS4NtG/HL2fagpaVoxvER/0YWJnL5gaOe/WCxRymYCG3Khf1bwjBFbFF8@j0e0iN/GIRpLqGsxvg9HF@F4OPp0dn48Hp4syMOv4@H5iTpva5vs21rSo6sK3iqxAG3sm92gn5av4XqwFo0Qz5FkYVrms7CIpGSlICVW@fnlx48WoCmDrSvZXGIQF7tg072FJWso6MGyBBcQbqMu3U119hrAqMr4jDdBuh71G0wJK@RvmUoW12XFc7GRUatN8xL0dLlfVi5OjAxHNjGNzIVrao/6i4rX6UER0cPwRDLnRDMs0o/5F54LRV7htbnBT0BCdro7VqlawlOxRZ6toFnn/b5QxKMNuNDR/B3wKA4M0VthmVmr1Al2a05Xwut41z4OmxlGglQu7Mx3lGEYoAovr4OG/DIIPBCqBw8C4fnQ6fCmx4uivKeARiklZOeHQJcwdMit6zMlzh8J/Pv3P4CfFo5XZoSgYQ1tppdUU76sLl2YzY5Cozk2hP6tahr3No3UXzPO4B70YHvb6tgKbNeNRhej8Pzi0/F4cEpfCOrya7TXYmLIsmavdDD86qzJrqY/zm/r8YZJrtZTa/Xc1FhpyRhZ@bfe0IZheabNiWgucWYsB7bxBD8dz72u1/svTrNoUj13My3T3f8f \"C++ (gcc) ‚Äì Try It Online\") `x(|x{5}|x((|){3,5}|)(|xxx)|(|)((||||){2,3}|)xxx?)(x*){5}` \n\\$n^7\\$: [Try it online!](https://tio.run/##hVX9TttIEP8/TzG4OthNnF4MPYRiDOIgEkgtVGnQ9UqRZex1sqqztux1CR/59x7gHvEe5LjZjySGRLpVYu/uzPzmexwXRXccxy/vEpZyweDz6XCwG55enQ3C68uLUfjHxdnoHA5a77iIszphcFjEJdt9PzlqxZOohLC4uYUAhs7v9/c/7vbqPx8evo4m@/cT8jIjz7On/fkzvunTnrs/V@cPc/o8w5tnSvChFn3adffmZktmM3qMdC3yYW5YLANFapsi4At9q8txoV0EYdHx/IahlSy5GCtLV3c8x1sWTY/W@I5aXEgocCtDVpZ5SeJcVBK0l@0pq6pozCg8VTLp92PkgMNDsNdqq@@ZSDIfSibrUoDnz9cw1TnOE@bCXZ5nkAdplFUKVquxcDe7v@3f@i3AxVMgOuDhmFmM0HIRg0NMxq5Pz0@GB21qiS5U/JHlKVka/uvipsFPKdVa1CI5HBsn4ryW0Ielo1S552gx0Bb0wXnjvBZ2HJRyvguHLuORZnU1MZ4sg9Kat2pR8bFgCWS5GJtHJKp7Vvo6YNOHMI6yDM2wvttTeJfl8Q9oxy78zHkC7SSSEcZOBUltIQiAKEqbbq8wqMXudJaZ6dnMTCMuCAJoA4sbLISMCVLQrncb9HzjgqkOKOLAIcd9x8ddJyjMy6Hk@BT/WxTva0Tc2w0lJhVlFfwYNxq6CcRFUUslrh3DFEK7ZIvzNJLxJNS@tFd7g1ayqs6ka1Lg20b9cvFtoG/StGJIRH/RhbGcvGJo5z9ZLFHKZgIbdqF/WvCMEVsUXz6PhrSI38chGkuoazG@DYZX4Wgw/HRxeTIanC2uB19Hg8szdd7WNtm3taRHVxW8VWIB2tg3u0E/LV/D9WAtGiGeI8nCtMynYRFJyUpBSqzyy@uPHy1AUwZbV7KZxCAudsEmuoUlayjowbIEFxBuoy7dTXX2FsCoyviUN0G6HvUbTAkr5P8ylSyuy4rnYiOjVpvmJejp8risXJwYGY50YhqZC9fUHvUXFa/TgyKih@GJZM6JZlikH/MvPBeKvEKyoeAnIiE73R2rVC3hqdgiz1bQrPN@X6jL4w240NH8HfAoDgzRW2GZWavUCXZvTjfC63i3Pg6bKUaCVC7szHaUYRigCom3QUN@GQQeCNWDh4HwfOh0eNPjRVE@UkCjlBKy812gSxg65Nb1mRLnlwT@@etvwE8LR5IZIWhYQ5vpJdWUr6tLF2azo9Bojg2hf6uaxr1NI/XXjDO4hz3Y3rY6tgLbdcPh1TC8vPp0Mjo9p68Edfk12msxMWRZszc6GH511mRX0x/nt/V4wyRXa95aPTc1VloyRlb@rTe0YVieaXMiGiLOjOXANp7gp@Ol1/V6/8ZpFo2rl26mZboH/wE \"C++ (gcc) ‚Äì Try It Online\") `x(|x{6}|x(|){3,6}(|x{4})|xx(||)((||||||){2,3}|||||)(xx)?|xxx(|){4}((||||){2,3}|))(x*){6}` \n\\$n^8\\$: [Try it online!](https://tio.run/##hVXrTttIFP6fpzi4WjKTON2YLl0UYxCFSCC1UKVB2y1FlrHHiVVnbNnjYiD5uw@wj7gPsuyZSxJDIq0Fzsy5fOd@HOZ5bxKGz28iFiecwefT0XDPP706G/rXlxdj/4@Ls/E5HLTeJDxMq4jBYR4WbO/t9KgVToMC/PzmFjwYWR/u73/cvav@fHj4Op6@v5@S55rM66ffF/OakPmcPu0v5vhQSdxf0HldK@pvC@Tij63Zil/Xkl0rxoHm70k@lfz6mJK6QxH4mb62adnQyT0/7zpuw@FSFAmfSI/XtCRDKgtmRxtyR62EC8jxKHxWFFlBwoyXAlS0nRkry2DCKDyVIhoMQpSAw0MwZHlUdMaj1IWCiarg4LiLDUx5D7OI2XCXZSlkXhykpYRVZgzczd7@@1u3BfgkMRCVeH/CDIZvpIjGIbpy16fnJ6ODDjVMG8rkkWUxWTn@65LSkKeUKivyIRkc6yDCrBIwgFWgVIZnKTVQHgzAehW8UrYs1LK@c4uu8hGnVTnVkayS0lq0Kl4mE84iSDM@0a@Al/escFXCZg9@GKQpumFiNzf/Ls3CH9AJbfiZJRF0okAEmDuZJHkEzwMiOR26u8agBrvbXVWmbyozCxJOEEA5mN9gI6SMk5z2nFuv7@oQdHdAHnoWOR5YLp66Xq5/LEqOT/F/hyK9QsR3e77AoqKuhJ/gQUE3gRKeV0Kqq8CwhNAp2PI@C0Q49VUsnfVZoxWsrFJh6xK4ZmC/XHwbKkoclwyZGC@GMBHTFwKd7CcLBWqZSuDgLu3P8iRlxDTFl8/jEc3Dt6GPzhJqG4xvw9GVPx6OPl1cnoyHZ0vy8Ot4eHkm77vKJ/NrPOnTdQfvFNiAJvfNaVBvI9cI3dvIho/3QDA/LrKZnwdCsIKTArv88vrjRwPQ1MHRFawWmMTlydvGN7BkAwUjWLXgEsJu9KW9rc9eA2hTaTJLmiA9h7oNoYjl4n@FChZWRZlkfKugMhtnBajt8rjqXNwYKa52ogc54bbuPeouO16VB1V4H9MTiCwhSmBZfqw/d2zIsxLZmoOfioi0e21jVD7ckblFmR2v2eeDAZfE4y240FXyXXAoLgzeX2PpXSvNcXavbzfc6Tq3Li6bGWaClDa067Z0DBNUIvPWa@ivkpB4XM7goccdF7rdpBnxsikfKaBT0ghpf@cYEqYOpVV/xsT6JYJ//vob8NOSIEuvEHSsYU3PkhzKl92lGrM5Ueh0ggOh/tY9jWdTRupuOKdxD/uwu2ts7Hhm6kajq5F/efXpZHx6Tl8oqvZrjNdyY4iiYq9sMPzqbOiutz/ubxPxlk0un0Vr/d42WHHBGFnHtznQWmB1p82NqJm4M1YLW0eCn47nfs/p/xvGaTApn3up0ukd/Ac \"C++ (gcc) ‚Äì Try It Online\") `x(|x{7}|x((||){5}||||)(|x{5})|xx(||){4}((|){4,5}|||||)(|xxx)|xxx((|){8}((|){2,5}|)|||)x?)(x*){7}`\nPerl 5 severely undercounts the number of possible matches ([Attempt This Online](https://ato.pxeger.com/run?1=RU-9asMwEKZrtr6BECJItZ3YnkpkxQmka6dubRCpiUGgJq7sgIqsjn2Arl0ypE-RN-nYJ-nZDpSD-_nuu7vvvk7V1ujjz9X1yxsihiOn98VGIzLlUIpstXxYzv2o3BtKahHzbM6ZQ6qEirnKqF2D8NMOc48WWtSVVg3FEQ7rw3PdwIgMoyRM2Pa1I-X_aAw4mxHJeLerhosbs9BZytxCPyZrAT5ecz9CqL-sLgBRmegJkAUBc6QASYhiiy1RTLxPaT4jhtE8d0FAijD2rPujHo97qb1SeCPhaJBO1ASj349PhCekAGILLe-lvLtfSfl9aMro9kxba21Ladsyl3rw1ubM3oAFA-N4Cac4SuMh_wM)); see below for a workaround. But Raku's Perl 5 compatibility mode (`:P5` adverb) fully evaluates every choice path (and not just due to its `:ex`haustive adverb ‚Äì it does the same without it).\n# Regex `üêá` (Perl / PCRE / Raku`:P5`), 30 bytes\n```\n(|xxx|(()||||||||||)xx?)x*x*x+\n```\n[Try it online!](https://tio.run/##RY9BbsIwEEX3PoVleWE3U4gDgRYTAhLddtUlkgURSKlMkiap5Cpxlz1Aj9iLpAOVqL3xvD9/5rs61jYezh@U15p2tsz2lvKxxjJZbjcvm5Unp7IWvElCvVxp2dH8hJXsqjovWsp2BdMeVYUWmzTvh6bFbgP3CpQ8vl309J@GyOWCG41TqOAWx63RVdm8FQwYINGEUp7hNvpa5sWVnvdVxxxz3Pi1lcnnWKQLXkuRpl0Q8AxCLzHxX6CbCTtHjP58fVM24hmm6zEj8d6Yp@etMYPonXO9ELK/HelcKt0d3mAYIpgQNYUZCSGKCZmTCajrUwFKMIUYZjCHB3i8cIXfjX4B \"Perl 5 ‚Äì Try It Online\") - Perl v5.28.2 / [Attempt This Online!](https://ato.pxeger.com/run?1=RVA9bsIwFN59CsvyYDcPiBP-igkBia6dOlayaESkVAbSECRXSTr2AF27MLTX6D1Ye4SeoA-oqN9gv-_n-dN7_8iXhd0fflbPlBeaVnaTLCzlHY1tNJ7P7maThqSbQvBt5OvxRMuKZil2ssqLbF1Sdr9mukFWocVG293DtkS1gZYCJZdPRz7-R33E5YgbjVOo4BbHTdGV26wUDBggogmlPMHf6OMmW5_Q1SKvmGOOm2ZqZfTSEfGIF1LEceV5PAG_kZj4HOhiQmWb0e_XN8raPMF0NWYkTWPMze3cmM9dmbaGX6J2ztVCyPpypHOxdFdY3lm0_7sOYQAhUV3oEx-CHiEDEoI6PRUgBV3oQR8GMITrI65wBcHZ-ws \"Perl - Attempt This Online\") - Perl v5.36+ \n[Try it online!](https://tio.run/##dVTbbts4EH3XV0xcNCYtJrDiNu1aUYNuNos@ZJvCSIEu0kBQaEoWIlMCJa2dNH7tB@wn7oesOyQlW25SX6nhzJkzZzjkRXGQcL5@kUqe1VMBJwVX4nD2zuGzSEFYXN9AAJPe74vF3e2o/vv@/svV7HgxI2vyuFwuHwmhj5sXXS5P6XKAb3dNf47oMRgUQVi4nu9ss5XVNM11uq5JpTLZtaU5WkU0f@r3zkllBQUuq1AolSvCc1lWYOgP5qIso0TQb5hnPOboACcn0Fj10tiFnGY@KFHVSoLnr5xalmkixRSyXCb2J5LlQijfZJvfhzzKsryuiFarfQhvs5zfwYBT@GbdXXcDO0RYExulkqCDA/gqrrGITEhS0APvJhj6YAnZ0qDgQY@cjns@rtygsH89Sk7P8LtH0V4j5OgorCDXwRo/wYXB7gKlsqgrHa4EDJTwoasRilJUykYrUdZZZddazTguRcUAi0OWSTWzO/k/gle5uh7d2FSIGoBVIp8XaSZQlkMeYnJCGXw6m5yHf1xevb@4gEf79Pnqz7cM9m1mu2hTDanFTGMge0rQVr/YtDgmWBZ6M@hpIMNRQYSUTDi8nI7hZflV4mHrYNo8DXC3Y0h720u7HSMe0UU@aEWNiImoslQKYs9QKpnVk/ro47WtbDk/UMA9rSzpf5V96@SbLRN1WKYPgtAgGFLdhSqVtfC3CJgYldapbXPK7d6GWZGX6OB3M7exUixCjGcgsbSoytMmadMMcHUw9XfjkJq2/gS3OUNcC4Wj0mM9/6kH5iGa6oDifKKOnJQMSMMDN/WvCx5@pU7v0WcwrtHJdfVF02f93f0ViKwUz1HbJp7bvJ2kz6Za7TzNxRzPBinR0QjWX/ZRNWyXYaMxLJpm1R6EVgm5C4zioZMVOk7llGAVzFgNiVZgCILuUI7H0qh@i7rd@dY9wNvHecp3tw3w3/d/AWffXjGG3sbTzm87jWIpOFGCwcfPFxcMsDGm1KH5NEPMYNTRSVO1GCdD2N9v8fYCO7fnk8nlJPx4@df7q7MP1Pn1UTnXc9k5LrqJv3ZvKmmv4ziry9kzNTV1rhwz9WM7rkoIZEw392xzgzmr9REbOd4rduwM2dFrx3njjJhnlh7DLfaKvWbH7A17y37Tds9j3tH/PM6ipFwfZFq/Hw \"C++ (gcc) ‚Äì Try It Online\") - PCRE1 \n[Try it online!](https://tio.run/##hVXrTuNGFP7vpxi8Esw4A43DwtIYg2iIRCQIq2xQt8siyziTxMIeW74sgcLfPkAfsQ9SeuZixyFZNRBn5sw537nO5yBNd2dB8PZhwqYhZ@hzb9TveL3r8753MxyMvd8H5@MLdGR8CHkQlROGjtMgY529@YkRzP0MeentHXLRyPzt8fHhfr/84@np63h@@DjHb/hlsVi8YExe6g9ZLE7JwoK/1ht5b2FSZKWul7Zsp@EuL7KQz4S/pSxMQMr8@GRN78QIeYFSWBYey7Ikw0HC8wLJWK2Y5bk/YwT9mReTbjcADXR8jLRYLKWc8UnkoIwVZcaR7byuYYp9kEwYRfdJEqHEnfpRLmClGw132zk4vHMMBJ9wirAsmzdjGsPTWljhYFX3m97F2ejIIvqQojx8ZskU14H/Ukka@oQQ6UV8cIJOVRJBUhaoi@pEiUjPlGZIRtBF5rvkpbFpgpX5nZukrsc0KvO5yqQuivFqlDwPZ5xNUJTwmXr4PH9kmSMLFj95gR9FEIbOXe@8@ygJHpAVUPQjCSfImviFD7UTRRJL5LoIixOLbC8xiMZuterOtHVnYj/kGABkgOktDELEOE7Jrn3nth2VgpoOlAauiU@7pgOrlpuqH5Pg0x58twjIS0Dc73gFNBVsBfwMFhK6CRTytCyEuUwMWoisjFX72C@CuSdzsZZrhZaxvIwKqlrg6Ov2ZfCtLyXTac7gEPKFFGbFfEXBSn6woAAr3Qm4dpX/OA0jhvVQfPk8HpE02As8CBYTqjG@9UfX3rg/uhoMz8b980rc/zruD8/75@hFC65uLseDy8GwT9G2jFL/6tjaZDnTWxmMpO5G837Ip9ZrFMNdq48He79g3jRLYi/1i4JlHGcw98Oby0sN0LSBy1ywRQFlrVbupnMNi9dQIIN6KCsI2phUumny3gMoV1EYh02QXZs4DaUJS4v/VcpYUGZ5mPCNitLtNMmQ5JvnepaBQyKgaqyudsipmkbiVHegas8zQSAXnIR3vvMdcP3s2o48khZ7gkswcd02QcJzyEvmLBHAKUyhcKvYM1@e1VGlSQ4KK54rW84ePbCniEOT/CIJtVM9lqgljImzaieIEqTv4OrbJ0lN8Bg1nXUN8INFqBaB9kPvApxDQ3UccCieLWTDlwv3NtmAcQtKrZZ4pYmSrSq8IgY0vym2pedYOW543ejrdWUXsxjGAeegKCu2s9iBskG/ZDgCQ6GJsKopqErBV4GheqCkKg0v9AneoYAlpDKIqsKCZBt81u1yWfZ7KNyDo9RdwfLr8a72Af3z198IaFORswyv1lRUt3pD5eVu8hR0SKbclv9LZoC1vgyNyongFepxG21vaw9brmay0eh65A2vr87GvQuyWpUGOVUMXGQla2CL1ho/HTid34Y34uvPSApIjTG8zGKd/JRCvSfN94k6BH6tX3cqbnjxvnXovmF/pIdGm3YODOOTsU9tubQpHNGP9IAe0k/0iP4q5LZN7c6/wTTyZ/nbbiRd7B79Bw \"C++ (gcc) ‚Äì Try It Online\") - PCRE2 v10.33 / [Attempt This Online!](https://ato.pxeger.com/run?1=hVbdTuNGFL6un2LwSmTGGWgcFpbGGEQhEki7sMoGdbsssowzSSycsWWPl0Dhtg_Q2970ppf7Cn2P7WWfpGd-7DgkVQN25uec7_zON_n9a5QlZSGfYBJFX6_trSSLctbd2rdvvg1ejdg45gy9Pxn0u8HJ5Wk_uLo4HwY_nZ8Oz9C-9SrmUVKOGDpQStvTQyuahjkKsusb5KOB_eP9_d3tTvnzw8PH4XTvfor_LMV4a_8v_DSfz58wJk_1h8znR2TuwF9bC_393SZ5qW9T5GR-kLVdr2G8EHnMJ9L6Yi1OYZWFs8MVuUMr5gJlMBQBy_M0x1HKC4GU586MFUU4YQT9UohRrxeBBDo4QGZZDtU646PEQzkTZc6R6z2vYMp5lI4YRbdpmqDUH4dJIWGVGQN33d3du_EsBJ94jLBKYjBhBiMwUljjYF2Fq5Oz48G-Q8wmRUX8yNIxrh3_vlppyBNClBX5wSk60kFEaSlQD9WBEhmerdSQ8qCH7BfBK2XbBi37M7dJnY8xdNBUR1InxXq2Sl7EE85GKEn5RL9CXtyz3FMJmz0EUZgk4IaJ3cyC2ySN7pATUfQljUfIGYUihNzJJMkh8n2E5Y5DNhcYxGC323VlOqYyszDmGACUg9k1NELCOM7Ilnvjdzwdgu4OlEW-jY96tgejtp_pL5vgoxN4Ngisl4C40w0EFBV0JfwEBgq6CRTzrBRSXQUGJUROzqr5LBTRNFCxOIuxRstZUSaC6hJ45vB9OP_UVyvjccFgE-KFECZiuiTgpF9YJEDLVAIOYWV_lsUJw6YpPrwfDkgWbUcBOIsJNRif-oPLYNgfvDu_OB72T6vl_sdh_-JUzjeVT-bbeNIhiw7eyKEBTe6bp0G9jVwjdH8lGwHMQ8GCcZ7OgiwUguUc59DlF1dv3xqApg4cXcHmApJYjfx1-wYWr6BABHULVhC00Zd0XZ-9BNCmkngWN0G2XOI1hEYsE_8rlLOozIs45WsFldlxmiPFLo915wJjJEDTWB_kmFPde8SrOr4qzyNBsC4ZCLc-8xaYfvRdT20pjW3JHJj4focgaTnmJfMWCGAUek6a1VxZLPZqr7K0AIEly5UuZ_cB6FPEoUihSGNj1DQhaktl4i3rSVqE1Rdw9VlTFCZZi9reqgTYwdJVh0D5oXYRLqCgxg_YlO82cuHh0rxL1mBcg1C7La-zFm0t7z8jBpy-zrWF4Zm22zC61tTz0mzGZtANuABBlbDWvAVZg3IpbySGRpNeVU1QZYIvA0PyQEgnGu7yEYYoqFpVTlQJlozaIK9ej6us30Le7jwt7ktKX_V3uQzon19_Q8CRmomVe7Wk5rXlA6rOdpOUoEAq5I76XxADjM1ZaGROOq9RDzpoc9NY2PANbQ0Gl4Pg4vLd8fDkjCxnpcFNFd2KvGQNbFnaJZ2lQE18a66_5__iKOA0xvAiilXu0wL1nDQvD70J9FrfbdpvuGX1z6U_vu106Y7lvqZ7Vod2dy3rjbVDXTV0KWzR13SX7tE3dJ_-INddl7pdrfsv \"C++ (GCC) - Attempt This Online\") - PCRE2 v10.40+ \n[Try it online!](https://tio.run/##TU/bSsNAEH3fr5iGYnbTsc32qg2h@tAnL7WggtRSqiR0JU1jNoUtafroB/iJ/kicFFFnYDicM3NmJgnSqF9udQA3k9ur8ZMH6x2chODD@PHyGqazvLEeBmZ412vN4QB1P1Sx0iuC01mr2Bycucdooq5914Nwk0Kk4kBzATmokGjI9XIHllV4VY/0GBz5RfN1tUx1zfddyImDau1FRGt1EqmM22gj6O2LzlJeXyA4p5KKCN6t59iC0eif5iKJAmo1chXe0StJVZyRXfNto@LKS9C9Nnx9fFI9QMg5aetlMgTb2MYRf32CznQmD/fNMNrqlVcU7Ofhku@NMXvOxf43hDEjYRzKRlm2scNkF/vMxXaPsQHroDxCiSRhF3vYxwGe4XnFS4my/Q0 \"Perl 6 ‚Äì Try It Online\") - Raku (Perl 6)\nThe part in the 27 byte version that is undercounted by Perl is `((||){2}||)`, the expression that multiplies possibilities by 11.\nPerl forces *any* loop to exit after making a zero-width match (whereas PCRE only does so on loops whose quantifier has no maximum, which I think is more logical), so `(||){2}` needs to be changed to `(||)(||)`, adding 1 byte.\nPerl prunes a group's alternatives down to one if they are all identical, but doesn't do this if even one alternative differs from the others. So `(||)` needs to be changed to `(()||)` in both places, adding 4 bytes.\nAfter all that, it becomes `((()||)(()||)||)`. But that's longer than `(()||||||||||)`, so we use the latter instead, at just 3 bytes longer than `((||){2}||)`.\n# Regex `üêá` `m` (PCRE), ~~73~~ 69 bytes\nWithout decomposing a fourth power into pentatope numbers, I'm pretty sure this is the best solution possible (it might golf down a tiny bit more than this, but not much):\n```\n^(?=(x*)\\1{3}(xx())?(x())?)((?=\\1(x*))(x+(|||)|\\3(|)|\\5).*(?=\\7$)){4}\n```\n[Try it online!](https://tio.run/##hVXrUuJIFP7PU7SZLe0OrUPA2xKj5SpVUqU4xWDt7KibiqGBlKGTymXEC3/3AfYR90HWPX1JCMLUUhA655z@zrW/9uN4e@z775@GbBRwhr6c9TtN9@z6vOPe9LoD9/fu@eACHdY@BdwP8yFDR7GfsObO5LjmT7wEufHtPXJQ3/jt6enxoZX/8fz8bTDZf5rg9z/xiYNnJrmzXltzPJthQk6wfBIMqjtLKAme1fHb2xt5u2th8dwjO6bQHvxCyOvu/J18BDYoMmPHjeuWXYkqzZKAj0VYC1kQgZR50@MVu@NawDMUwzJzWZJECfYjnmZIpmROWZp6Y0bQa5oN220fLNDREdJisZRyxoehjRKW5QlHlj1fwRTvfjRkFD1EUYgiZ@SFqYCVbjTcbXNv/96uIfgEI4Rldd0x0xiutsIKB6v23JxdnPYPTaKVFKXBC4tGuAz8cyGp2BNCpBfxwRE6UUn4UZ6hNioTJSI9Q25DMoI2Mj4kLzcbBuwy7rhBynqMwjydqEzKotTmtZynwZizIQojPlYPj6dPLLFlwabPru@FIYShc9dv7kMY@Y/I9Cn6EQVDZA69zIPaiSKJJXIchIXGJJsLDKKx6/WyMw3dmakXcAwAMsD4FgYhZBzHZNu6dxq2SkFNB4p9x8AnbcOGVd2J1Z9B8MkZ/DYIyHNAbDXdDJoKewX8GBYSugoU8DjPxHaZGLQQmQkr3qde5k9cmYu5WCu0hKV5mFHVAlufyq/d7x0pGY1SBkrIF1IYZ5MlAzP6wfwMdulOwOks/E/jIGRYD8XXL4M@if0d34VgMaEa43unf@0OOv2rbu900DkvxJ1vg07vvHOO3rTg6uZy0L3s9joUbcoo9b@OrUEWM72RwEjqblTPh3xqu0oxnJX6uPDuZcwdJdHUjb0sYwnHCcx97@byUgNU98Bhztgsg7IWK2edXsPiFRTIoBzKAoJWJpWum7yPAMpVGEyDKsi2ReyK0ZDF2f8aJczPkzSI@FpD6XYUJUjyzUs5y8AhITA6Vkc74FRNI7GLM1C054UgkAtOwlt3fAtcvziWLVVyx47gEkwcp0GQ8BzwnNkLBHAKUyjcKvZMF7oyqjhKwWDJc7GXsycX9lPEoUleFgXaqR5LVBebib28TxAlSD/AladPkprgMWrYqxbgB4tQTQLth975OIWG6jhAKZ51ZMGPC/cWWYNxC0b1urj5RMmWDeaIAc2vi23heaocV7yu9TVfepuyKYwDTsFQVmxrtgVlg37JcASGQhNhFVNQlIIvA0P1wEhVGu79Id6igCWkMoiiwoJkK3zWbnNZ9gco3KOtzB3B8qvxLvcB/fPX3whoU5GzDK@0VFS3fELl4a7yFHRIptyQ3wUzwFofhkrlRPAK9aiBNje1hw1HM1m/f913e9dXp4OzC7JclQo5FQycJTmrYIvW1n46cDq/NTfi/GckBaTGGF5ksUp@yqB8J9X7RCmBX8vrTsUNF@97k7Zq1i7drzVoc69WO6i1qCWXFgUV3aV7dJ8e0EP6q5BbFrWa//qj0Bun79uhdLF9@B8 \"C++ (gcc) ‚Äì Try It Online\") - PCRE2 v10.33 / [Attempt This Online!](https://ato.pxeger.com/run?1=hVbLUuNGFF3HX9FoUtAtN8SygWEsBMWAq3AVjymPqUwGiErIbVuF3FLpMZiHt_mAbLPJJsv5ILLMl-T2Q7KMnYrLklu37z332Uf-47sfh3kqLnfk-9-vjc0w9hPW3Nwzbl977wZsGHCGPh33Ok33-PKk415ddPvuz92T_inaq70LuB_mA4b2pdHW-KDmj70EufH1LXJQz_j48HB_18p_eXz80h_vPozxX3k23Nx77fyKDx08NcmN9dya4ekUE3KI5Z1g2LqxxCbB0zp-eXkhLzctLO47ZMsUu-9_JOR5e6bA_v7hA3nrx6DIjB03rlt2Jcg0SwI-ElHOZUEEUuZNDpb0DmoBz1AMy8xlSRIl2I94miGZoTlhaeqNGEHPaTZot33QQPv7SIvFUsoZH4Q2SliWJxxZ9mwJUzz70YBRdBdFIYqcoRemAla60XDXzZ3dW7uG4BMMEZbFdkdMY7haCyscrLp1dXx61Nszid6kKA2eWDTEZeA_FZKKPiFEehEfHKFDlYQf5RlqozJRItIzpBmSEbSR8SZ5aWwYYGXccIOU9RjCpI1VJmVRarNaztNgxNkAhREfqZvH0weW2LJgk0fX98IQwtC56yf3Loz8e2T6FH2LggEyB17mQe1EkcQSOQ7CYsck63MMorHr9bIzDd2ZiRdwDAAywPgaBiFkHMdk07p1GrZKQU0Hin3HwIdtw4ZV3YnVj0Hw4TFcawTkOSC2mm4GTQVbAT-ChYSuAgU8zjNhLhODFiIzYcXzxMv8sStzMedrhZawNA8zqlpg60P6ufu1IyXDYcpgE_KFFEbZeEHBjL4xPwMr3Qk4rIX_SRyEDOuh-Pyp3yOxv-W7ECwmVGN87fQu3X6nd969OOp3Tgpx50u_c3HSOUEvWnB-ddbvnnUvOhStyyj1r46tQeYzvZbASOpuVM-HvGu9SjGcpfq48OxlzB0m0cSNvSxjCccJzP3F1dmZBqjawGHO2DSDshYrZ9W-hsVLKJBBOZQFBK1MKl01eW8BlKswmARVkE2L2BWlAYuz_1VKmJ8naRDxlYrS7TBKkOSbp3KWgUNCIHisjnbAqZpGYhdnoGjPE0EgF5yEN274Brh-cixbbkmLLcElmDhOgyDhOeA5s-cI4BSmULhV7JnO98qo4igFhQXPhS1nDy7YU8ShSV4WBdqpHktUF8bEXrQTRAnSN3Dl6ZOkJniMGvayBvjBIlSTQPuhdz5OoaE6DtgU9zqy4OLCvUVWYFyDUr0uXoSiZIsKM8SA5lfFNvc8UY4rXlf6mi08TdgExgGnoCgrtjHdgLJBv2Q4AkOhibCKKShKwReBoXqgpCoNfwMGeIMClpDKIIoKC5Kt8Fm7zWXZ76Bw97ZSdwTLL8e72Af0z2-_I6BNRc4yvFJTUd3iCZWHu8pT0CGZckN-58wAa30YKpUTwSvU_QZaX9ce1hzNZL3eZc-9uDw_6h-fksWqVMipYOAsyVkFW7R2wWYhUZ3fijfi7L9ICkiNMTzPYpn8lEL5TKrvE7UJ_Fq-7lTc8OJV_6D-fG01aatmbdPdWoM2d2q197UWteTSorBFt-kO3aXv6R79IOSWRa2msv0X \"C++ (GCC) ‚Äì Attempt This Online\") - PCRE2 v10.40+\n```\n^ # tail = N = input number\n(?=\n (x*)\\1{3} # \\1 = floor(tail / 4)\n (()xx)?(()x)? # \\3,\\5 = {tail % 4} in binary:\n # \\3 set|unset = 2's place digit 1|0\n # \\5 set|unset = 1's place digit 1|0\n)\n(\n # Manipulate the number of possible matches to be exactly \\1 * 4 + \\2 == N\n (?=\\1(x*)) # \\7 = tail - \\1\n (\n x+(|||) # Add \\1 * 4 to the number of possibilities of this iteration\n |\n \\3(|)|\\5 # Add \\3*2 + \\5 (where set=1 and unset=0) to the number of\n # possibilities of this iteration\n )\n .*(?=\\7$) # tail = \\7, i.e. the next multiple of \\1 down from what it\n # was when \\7 was captured above.\n){4} # Iterate the above 4 times, such that after finishing, each\n # iteration could have been at any one of the N states.\n```\nThis method does eventually win out against simplex decomposition:\n1: `x` \n‚Äá‚Äà `x`\n2: `x?x+` \n‚Äá‚Äà `^(?=(x*)\\1(x()|))\\2(x+(|)|\\3).*(?=\\1$)(?4)`\n3: `(|xx|(|||)x)x*x+` \n‚Äá‚Äà `^(?=(x*)\\1\\1(x())?(x())?)((?=\\1(x*))(x+(||)|\\3|\\5).*(?=\\7$)){3}`\n4: `(|xxx|((||){2}||)xx?)x*x*x+` \n‚Äá‚Äà `^(?=(x*)\\1{3}(xx())?(x())?)((?=\\1(x*))(x+(|||)|\\3(|)|\\5).*(?=\\7$)){4}`\n5: `x(|x{4}|x((||||){2}|)(|xx)|((|){6}||)xx)(x*){4}` \n‚Äá‚Äà `^(?=(x*)\\1{4}(xx())?(x())?(x())?)((?=\\1(x*))(x+(||||)|\\3(|)|\\5|\\7).*(?=\\9$)){5}`\n6: `x(|x{5}|x((|){3,5}|)(|xxx)|(|)((||||){2,3}|)xxx?)(x*){5}` \n‚Äá‚Äà `^(?=(x*)\\1{5}(xx())?(xx())?(x())?)((?=\\1(x*))(x+(|||||)|\\3(|)|\\5(|)|\\7).*(?=\\9$)){6}`\n7: `x(|x{6}|x(|){3,6}(|x{4})|xx(||)((||||||){2,3}|||||)(|xx)|xxx(|){4}((||||){2,3}|))(x*){6}` \n‚Äá‚Äà `^(?=(x*)\\1{6}(xxx())?(xx())?(x())?)((?=\\1(x*))(x+(||||||)|\\3(||)|\\5(|)|\\7).*(?=\\9$)){7}`\n8: `x(|x{7}|x((||){5}||||)(|x{5})|xx(||){4}((|){4,5}|||||)(|xxx)|xxx((|){8}((|){2,5}|)|||)x?)(x*){7}` \n‚Äá‚Äà `^(?=(x*)\\1{7}(x{4}())?(xx())?(x())?)((?=\\1(x*))(x+(|){3}|\\3(|||)|\\5(|)|\\7).*(?=\\9$)){8}`\n[Answer]\n# [CP-1610](https://en.wikipedia.org/wiki/General_Instrument_CP1600) assembly, 30 DECLEs = 38 bytes\nLet's try this on a processor lacking a multiply instruction. This code is intended to be run on an [Intellivision](https://en.wikipedia.org/wiki/Intellivision).\nCP-1610 instructions are encoded with 10-bit values, known as *'DECLE'* s. This subroutine is 30 DECLEs long, starting at $4808 and ending at $4825.\n[Takes input in registers](https://codegolf.meta.stackexchange.com/a/7425/58563) *R0* and *R3*. Saves the result in *R2*.\n```\n ROMW 10 ; use 10-bit ROM\n ORG $4800 ; map program at address $4800\n4800 02B8 000E MVII #14, R0 ; example call\n4802 02BB 0006 MVII #6, R3\n4804 0004 0148 0008 CALL addX4Y4\n4807 0017 DECR PC ; loop forever\n4808 0275 addX4Y4 PSHR R5 ; push the return address\n4809 0004 0148 001A CALL square ; compute R2 = R0^2\n480C 0004 0148 0019 CALL square2 ; compute R2 = R2^2\n480F 0272 PSHR R2 ; push this result on the stack\n4810 0098 MOVR R3, R0 ; compute R2 = R3^2\n4811 0004 0148 001A CALL square\n4814 0004 0148 0019 CALL square2 ; compute R2 = R2^2\n4817 02F2 ADD@ R6, R2 ; add this result to the intermediate one\n4818 02B7 PULR PC ; return\n4819 0090 square2 MOVR R2, R0 ; copy R2 to R0\n481A 0081 square MOVR R0, R1 ; copy R0 to R1\n481B 01D2 CLRR R2 ; initialize R2 = result\n481C 0200 0002 B halve ; start by halving R1\n481E 00C2 add ADDR R0, R2 ; add R0 to R2\n481F 0048 loop SLL R0 ; double R0\n4820 0079 halve SARC R1 ; halve R1\n4821 0221 0004 BC add ; was the LSB set?\n4823 022C 0005 BNEQ loop ; is R1 now equal to zero?\n4825 00AF JR R5 ; return\n```\n### Example run\nRunning the above code (with *R0* = 14 and *R3* = 6) gives:\n```\n> b 4807\nSet breakpoint at $4807\n> r\nHit breakpoint at $4807\n 0900 0000 9B20 0006 01FE 4817 02F1 4807 S-----iq DECR R7\n ^^^^\n```\n*R2* is set to $9B20, which is 39712 in decimal.\n[Answer]\n# Perl, 12 bytes\nIncludes `+1` for `p`\nWorks for 1 or more numbers each given on a separate line on STDIN\n```\n(echo 2; echo 3) | perl -pe '$\\+=$_**4}{'\n```\n[Answer]\n# [Haskell](https://www.haskell.org/), 11 bytes\n```\nsum.map(^4)\n```\nThis is a function that takes the parameters as a list.\n[Try it online!](https://tio.run/##y0gszk7Nyfn/P822uDRXLzexQCPORPN/bmJmnoKtQko@F2dBUWZeiYKKQppCtJGOgnEsioihiY6CGaqQgY6CkWnsfwA \"Haskell ‚Äì Try It Online\")\n[Answer]\n# [><>](https://esolangs.org/wiki/Fish), 11 bytes\n```\n:*:*$:*:*+n\n```\n[Try it online!](https://tio.run/##S8sszvj/30rLSksFRGjn/f//X7fMCIiNAQ \"><> ‚Äì Try It Online\")\nTakes values through the `-v` flag. Dupe and multipy, dupe and multiply, and repeat with the other value before adding the two together and printing.\n[Answer]\n## [Retina](https://github.com/m-ender/retina/wiki/The-Language), 9 bytes\n```\n.+\n****\n_\n```\n[Try it online!](https://tio.run/##K0otycxLNPz/X0@bSwsIuOL//zc04TIDAA \"Retina ‚Äì Try It Online\")\nInput should be linefeed-separated.\n### Explanation\n```\n.+\n****\n```\n`*` is Retina's repetition operator. It has implicit operands `$&` and `_`, respectively, so the substitution pattern is short for `$&*$&*$&*$&*_`. It's also right-associative, if the regex matches a decimal number **n**, this generates a string of **n4** underscores (i.e. a unary representation of the fourth power of **n**). \n```\n_\n```\nTo sum the two results and convert the sum back to decimal, we simply count the number of underscores in the string.\n[Answer]\n# [Japt](https://github.com/ETHproductions/japt), 3 bytes\nTakes input as an array of integers; can handle negatives and more than 2 integers at a time. Add `N` at the beginning to take input as individual integers.\n```\nxp4\n```\n[Try it](https://ethproductions.github.io/japt/?v=1.4.5&code=eHA0&input=WzE0LDZd)\n---\n## Explanation\n`p4` raises each element to the power of 4 and `x` reduces by addition.\n[Answer]\n# [Pyt](https://github.com/mudkip201/pyt), 2 [bytes](https://github.com/mudkip201/pyt/wiki/Codepage)\n```\n‚Å¥∆©\n```\n[Try it online!](https://tio.run/##K6gs@f//UeOWYyv//4820TGJBQA)\nTakes input as a list.\n[Answer]\n# [APL (Dyalog Unicode)](https://www.dyalog.com/), 5 [bytes](https://codegolf.meta.stackexchange.com/a/9429/43319 \"When can APL characters be counted as 1 byte each?\")[SBCS](https://github.com/abrudz/SBCS \".dyalog files using a single byte character set\")\nAnonymous tacit prefix function. Takes a list as argument. The list may have any length and contain any numbers, even complex ones.\n```\n+.*‚àò4\n```\n[Try it online!](https://tio.run/##SyzI0U2pTMzJT///P@1R2wRtPa1HHTNMgBwFIx0FYy6uNAVDEx0FMxDDQEfByBQA \"APL (Dyalog Unicode) ‚Äì Try It Online\")\n`+.*`‚ÄÉis a variant on matrix product, `+.√ó` as follows: `a b+.√óc d` is `(a√óc)+(b√ód)` and `a b+.√óc` is `(a√óc)+(b√óc)`. So `a b+.*c` is `(a*c)+(b*c)`. `*` is power.\n`‚àò4`‚ÄÉcurry four as right argument. This results in a monadic function `(a*4)+(b*4)`.\n[Answer]\n# [J](http://jsoftware.com/), 7 6 bytes\n-1 byte thanks to Ad√°m\n```\n1#.^&4\n```\n[Try it online!](https://tio.run/##y/qvpKeepmBrpaCuoKNgoGAFxLp6Cs5BPm7/DZX14tRM/mtyKXClJmfkK6QpGCkYw5iGJgpmcHEDBSNTBDveUCHeSCHeWCHeRMHI@D8A \"J ‚Äì Try It Online\")\nWorks for lists with arbitrary length\n`^&4` - each item of the list to the 4-th power\n`1#.` - sum of all 4-th powers by base-1 conversion\n[Try it online!](https://tio.run/##y/qvpKeepmBrpaCuoKNgoGAFxLp6Cs5BPm7/tfUdrOJMrP5rcilwpSZn5CukKRgpGMOYhiYKZnBxAwUjUwQ73lAh3kgh3lgh3kTByPg/AA \"J ‚Äì Try It Online\")\n## Alternative\n# [J](http://jsoftware.com/), 7 bytes\n```\n+/ .^4:\n```\nThis is a variant of the matrix product, analogue of Ad√°m's APL solution\n[Try it online!](https://tio.run/##y/qvpKeepmBrpaCuoKNgoGAFxLp6Cs5BPm7/tfUV9OJMrP5rcilwpSZn5CukKRgpGMOYhiYKZnBxAwUjUwQ73lAh3kgh3lgh3kTByPg/AA \"J ‚Äì Try It Online\")\n[Answer]\n# Python 3, 20 bytes\n```\nlambda x,y:x**4+y**4\n```\n[Answer]\n# [MATL](https://github.com/lmendo/MATL), 3 bytes\n```\nK^s\n```\n[Try it online!](https://tio.run/##y00syfn/3zuu@P//aEMTHbNYAA \"MATL ‚Äì Try It Online\")\nThis can handle more than two input values, as well as negative inputs.\n### Explanation:\nFasten your seat belts, this might blow your mind!\n```\n % Implicit input\nK % Push literal 4\n ^ % Raise each element of the input vector to the 4th power\n s % Sum\n```\nAlso works:\n```\n4^s % Push 4 and raise input to it, then sum\nUUs % Square input twice, then sum\n```\n[Answer]\n# JavaScript (ES7), 15 bytes\nDoes exactly what it says on the tin.\n```\na=>b=>a**4+b**4\n```\n### Test cases\n```\nlet f =\na=>b=>a**4+b**4\nconsole.log(f(2)(3))\nconsole.log(f(14)(6))\nconsole.log(f(0)(25))\n```\n[Answer]\n# [05AB1E](https://github.com/Adriandmen/05AB1E), 3 bytes\n```\n4mO\n```\n[Try it online!](https://tio.run/##MzBNTDJM/f/fJNf///9oQxMdXbNYAA \"05AB1E ‚Äì Try It Online\")\n**Explanation**\n```\n4m # raise each to the power of 4\n O # sum\n```\n[Answer]\n# [Julia](http://julialang.org/), 11 bytes\n```\na$b=a^4+b^4\n```\n[Try it online!](https://tio.run/##yyrNyUw0@/8/USXJNjHORDspzuR/QVFmXklOnoahiYqZJheMZ6BiZKr5HwA \"Julia 0.6 ‚Äì Try It Online\")\n---\n# [Julia](http://julialang.org/), 12 bytes\n```\n!a=sum(a.^4)\n```\n[Try it online!](https://tio.run/##yyrNyUw0@/9fMdG2uDRXI1EvzkTzf0FRZl5JTp6GYrShiYJZrCYXQsBAwcg0VvM/AA \"Julia 0.6 ‚Äì Try It Online\")\n[Answer]\n# Excel, 10 bytes\n```\n=A1^4+B1^4\n```\nNothing to see here.\n[Answer]\n# [C (gcc)](https://gcc.gnu.org/), 26 bytes\n```\nf(a,b){a=a*a*a*a+b*b*b*b;}\n```\n[Try it online!](https://tio.run/##S9ZNT07@/z9NI1EnSbM60TZRCwy1k7TA0Lr2f25iZp6GZnVBUWZeSZqGkmpKDRgp6aRpGOkYawIpQxMdMxBtoGNkqqkJ1AIA \"C (gcc) ‚Äì Try It Online\")\n[Answer]\n## C, C++ => 29 bytes\n-1 byte thanks to Jonathan Frech\n```\n#define Q(a,b)a*a*a*a+b*b*b*b\n```\nTest cases :\n```\n#include \nint main() {\n printf(\"Q(%d,%d) = %d\\n\", 2, 3, Q(2, 3));\n printf(\"Q(%d,%d) = %d\\n\", 14, 6, Q(14, 6));\n printf(\"Q(%d,%d) = %d\\n\", 0, 25, Q(0, 25));\n}\n```\n[Answer]\n# [Jelly](https://github.com/DennisMitchell/jelly), 3 bytes\n```\n*4S\n```\n[Try it online!](https://tio.run/##y0rNyan8/1/LJPj///9GOgrGAA \"Jelly ‚Äì Try It Online\")\n[Answer]\n# [Triangularity](https://github.com/Mr-Xcoder/Triangularity), 31 bytes\n```\n...)...\n..IEM..\n.)4s^}.\nu......\n```\n[Try it online!](https://tio.run/##KynKTMxLL81JLMosqfz/X09PTxOIufT0PF19QbSmSXFcrR5XqR4Y/P8fbaRjHAsA \"Triangularity ‚Äì Try It Online\")\n[Answer]\n# [C (gcc)](https://gcc.gnu.org/), 0 + 24 bytes\nCompile this code \n```\nmain(){\n printf(\"%d\\n\",x(2,3));\n printf(\"%d\\n\",x(14,6));\n printf(\"%d\\n\",x(0,25));\n}\n```\nWith this flag:\n```\n-D=x(a,b)a*a*a*a+b*b*b*b\n```\n[Try it online! (GCC Tio)](https://tio.run/##S9ZNT07@//9/bmJmnoZmNRdnQVFmXkmahpJqSkyekk6FhpGOsaamNaa4oYmOGVYJAx0jU5BE7f9/yWk5ienF/3VdbCs0EnWSNBO1wFA7SQsMAQ \"C (gcc) ‚Äì Try It Online\") \n[Try it online! (Bash Compile example)](https://tio.run/##S0oszvifmpyRr6CknJmXnFOakqpgU1ySkpmvl2GnpGBnp5Col8wFUZCbmJmnoVmNJqqgUFCUmVeSphGjpJoSkxejpFOhYaRjrKlpTYRCQxMdM@JUGugYmWKqrIXzudKTk0EMBaWY/7outhUaiTpJmolaYKidpAWGMf@VuPT0E/XyS0v@AwA \"Bash ‚Äì Try It Online\")\n[Answer]\n# [R](https://www.r-project.org/), 16 bytes\n```\npryr::f(x^4+y^4)\n```\n[Try it online!](https://tio.run/##K/r/P81Gt6CossjKKk2jIs5EuzLORPN/moaRjoKxJleahqGJjoIZiGGgo2BkqvkfAA \"R ‚Äì Try It Online\")\n[Answer]\n## Ruby, 16 bytes\n```\n->a,b{a**4+b**4}\n```\n[Try It Online!](https://tio.run/##KypNqvz/P81W1y5RJ6k6UUvLRDsJSNRycRUopEUb6RjHghkGOkamsf//AwA)\n[Answer]\n# Java 8, 21 bytes\n```\na->b->a*a*a*a+b*b*b*b\n```\n[Try it online.](https://tio.run/##jc5NC4JAEAbgu79ijmq5lH1cLI9Bh04eo8O4mqyt66KjIOJvt8X0nLwwvDAPzOTYolfqVOXJZ@QS6xoeKFRvAdSEJDjkRrCGhGTvRnESpWK3uVzuitIsrbbr0FzCEDhcYUQvjL0Q3Smb2J0yBuYygBm6iaU5P3/RliKBwnxmR1QJlT1f6PQTjbqa0oKVDTFtNiSVzRlqLTvbd@ZycJzgH94fF31eoXcL9k8/PVjD@AU)\n[Answer]\n# [Perl 6](http://perl6.org/), 9 bytes\n```\n*‚Å¥+*‚Å¥\n```\n[Try it online!](https://tio.run/##K0gtyjH7n1upoJamYPtf61HjFm0Q8d9aoTixUkFJJV7B1k6hOk2hRiW@VkkhLb9IwcZIwdhOR8HG0ETBDEQbKBiZ2ln/BwA \"Perl 6 ‚Äì Try It Online\")\n[Answer]\n# Pyth, 5\n```\nsm^d4\n```\n[Online test](https://pyth.herokuapp.com/?code=sm%5Ed4&input=%5B2%2C3%5D&test_suite=1&test_suite_input=%5B2%2C%203%5D%0A%5B16%2C%206%5D%0A%5B0%2C%2025%5D&debug=0).\n```\n ^d4 # lambda to take 4th power\n Q # implicit input\n m # map lambda over input\ns # sum\n```\n[Answer]\n# [Attache](https://github.com/ConorOBrien-Foxx/attache), 8 bytes\n```\nSum@`^&4\n```\n[Try it online!](https://tio.run/##NYwxC8IwEEb3@xU3FNFyg9bqXNBZBN2OE2O8xAyGYs7fHwvSb3pveJ8zc/6l9aghZeUmUL1838P9tuirwLLFh8aU0bRYyhHbFZxUn4WbcfRRYM7MEwNO445wK/TnTU@4n2VN2O0EROD8Sdmu0@PBFS0cCM1L/QE \"Attache ‚Äì Try It Online\")\nTakes input as a pair of integers.\n## Explanation\nThis is a composition of two functions:\n* `Sum`\n* ``^&4`\nThe first executed is ``^&4`, which is equivalent to:\n```\n`^&4\nRBond[`^, 4]\nRBond[{_1 ^ _2}, 4]\n{_1 ^ 4}\n```\nThat is, a function that raises its argument to the fourth power. This vectorizes over the input array. Then, `Sum` takes the sum of these elements.\n## Alternative approaches\n```\nSum@`^&4@V ?? 11 bytes, input is two arguments\n{Sum[_^4]} ?? 11 bytes, input is array\n{_^4+_2^4} ?? 11 bytes, input is two arguments\n```\n[Answer]\n# [Pyramid Scheme](https://github.com/ConorOBrien-Foxx/Pyramid-Scheme), 220 bytes\n```\n ^\n / \\\n / \\\n / + \\\n / \\\n ^---------^\n /^\\ /^\\\n ^---^ ^---^\n /#\\ /4\\ /#\\ /4\\\n ^--- --- ^--- ---\n /l\\ /l\\\n/ine\\ /ine\\\n----- -----\n```\n[Try it online!](https://tio.run/##TY3dCoAwCEbvfQqhywihehwRogYNVkRd9fRWrv0IsnPchx73OW1@6a55dZtTxVIChQkZKsFKX2srp/9NA@lS/ftIOEUlhr6I5LDFqGGkkQtB/MSvMwFSyMsCA/ndRTcCO2tupNrD8AA \"Pyramid Scheme ‚Äì Try It Online\")\n`line` pyramids obtain a line from STDIN, `#` pyramids cast their arguments into numbers, `^` pyramids perform exponentiation, and the `+` pyramid adds two things together.\n[Answer]\n# Minkolang 0.15, 10 bytes\n```\n$n4;r4;+N.\n```\n[Try it here.](http://play.starmaninnovations.com/minkolang/?code=%24n4%3Br4%3B%2BN%2E&input=2%203)\n## Explanation\n```\n$n4;r4;+N.\n$n take all input as numbers [a, b]\n 4; raise to the fourth [a, b^4]\n r reverse stack [b^4, a]\n 4; raise to the fourth [b^4, a^4]\n + add [b^4 + a^4]\n N output []\n . terminate\n```\n[Answer]\n# [D](https://dlang.org/), 25 bytes\n```\n(int x,int y)=>x^^4+y^^4;\n```\n[Try it online!](https://tio.run/##S/mfWFqSr5Bm@18jM69EoUIHRFZq2tpVxMWZaFcCCev/mbkF@UUlCsUlKXpAnJlvzVWWn5mikJuYmaehWc1VXpRZkpqTp5GmYaRjrKlpzVX7HwA \"D ‚Äì Try It Online\")\nA simple lambda that performs exponentiation on each of its arguments, with `^^` being the exponentiation operator.\n]"}}},{"rowIdx":13897,"cells":{"text":{"kind":"string","value":"[Question]\n [\n(Taken from )\n[](https://i.stack.imgur.com/lg5ce.png)\nA tangential quadrilateral (see example above) is a quadrilateral in which a circle can be inscribed.\nYour task is to find the possible value of `d` given `a`, `b`, and `c`.\n# Specs\n* `a`, `b`, `c` will all be positive integers.\n* If no possible value of `d` exists, output `0`.\n# Scoring\nThis is [code-golf](/questions/tagged/code-golf \"show questions tagged 'code-golf'\"). Shortest solution in bytes wins.\n# Testcases\n```\na b c d\n3 4 4 3\n1 2 3 2\n1 5 3 0\n```\n \n[Answer]\n# Dyalog APL, 4 bytes\n```\n0⌈-/\n```\n[Try it online!](http://tryapl.org/?a=f%u21900%u2308-/%20%u22C4%20f%203%204%204%20%u22C4%20f%201%202%203%20%u22C4%20f%201%205%203&run)\n### How it works\n```\n0⌈-/ Monadic function train. Argument: (a b c)\n -/ Reduce by subtraction.\n APL evaluates everything from right to left, so this computes\n a - b - c = a - (b - c) = a - b + c.\n0⌈ Take the maximum of 0 and a - b + c.\n```\n[Answer]\n# Piet, 32 Codels [enter image description here](https://i.stack.imgur.com/u3EaB.png)\nCodelsize 20:\n[](https://i.stack.imgur.com/4p4AF.png)\n### Notes\n* Pretty straightforward. Could be 7x3=21 Codels if it wasn't for the termination, [but it seems like thats required by default.](http://meta.codegolf.stackexchange.com/questions/4782/do-programs-have-to-terminate)\n### Npiet trace images\nValid input [1, 2, 3]\n[](https://i.stack.imgur.com/zvkdR.png)\nInvalid input [1, 5, 3]\n[](https://i.stack.imgur.com/slkpL.png)\n[Answer]\n# [05AB1E](http://github.com/Adriandmen/05AB1E), ~~5~~ 4 bytes\nInput is taken as:\n```\nb\na\nc\n```\nCode:\n```\n-+0M\n```\nExplanation:\n```\n # Inputs: b, a, c\n- # Substract, (a - b).\n + # Add with implicit input, (a - b + c).\n 0 # Push zero on top of the stack.\n M # Get the largest number that exists in the stack and implicitly print that value.\n```\n[Try it online!](http://05ab1e.tryitonline.net/#code=LSswTQ&input=NAozCjQ)\n[Answer]\n# [Jelly](http://github.com/DennisMitchell/jelly), 5 [bytes](https://github.com/DennisMitchell/jelly/wiki/Code-page)\n```\n_@/»0\n```\n[Try it online!](http://jelly.tryitonline.net/#code=X0Avwrsw&input=&args=MywgNCwgNA) or [verify all test cases](http://jelly.tryitonline.net/#code=X0AvwrswCsOH4oKsRw&input=&args=WzMsIDQsIDRdLCBbMSwgMiwgM10sIFsxLCA1LCAzXQ).\n### How it works\n```\n_@/»0 Main link. Argument: [a, b, c]\n_@/ Reduce by swapped subtraction.\n This computes (a _@ b) _@ c = c - (b - a) = c - b + a.\n »0 Take the maximum of 0 and c - b + a.\n```\n[Answer]\n# MATL, 6 bytes\n```\n-+OvX>\n```\nMy very first MATL answer! It can probably be shorter, I'd love tips! Input is backwards, e.g.:\n```\nc\nb\na\n```\n[Try it online!](http://matl.tryitonline.net/#code=LStPdlg-&input=Mwo0CjQ).\nExplanation:\n```\n- #Subtract the top two numbers (c and b)\n + #Add the top two numbers (c-b and a)\n O #Push a 0\n v #Concatenate this into a array\n X> #Print the smallest value of the array\n```\n[Answer]\n# [Cubix](https://github.com/ETHproductions/cubix), 12 ~~9~~ bytes\nThis turned out longer than I wanted and then I messed up the spec. I might be able to knock out a byte or 2.\n```\n@w+?II-.\\0O@\n```\nWraps onto a cube with side length 2\n```\n @ w\n + ?\nI I - . \\ 0 O @\n. . . . . . . .\n . .\n . .\n```\nGets `II` integer input twice, `-.` subtract followed by noop, `\\` redirect down (in this case around), hits the second `I` input again, `+` adds, `?` conditional that turns left on negative, right on positive and straight through for zero. \nTurning left (invalid negative) `w` change lane to the right onto the literal `0` heading right through the `O@` output and terminate. \nStraight through (invalid zero) hits `\\` reflector and head right onto the literal `0` and the `O@` output terminate. \nTurning right (valid positive) travels around the cube, hitting the `O` output on the bottom face, onto the `w` change lane right, that switches the lane to the `@` terminate.\n[Try it here](https://ethproductions.github.io/cubix)\n[Answer]\n# J, ~~12~~ ~~9~~ ~~8~~ 5 bytes\nInput is given as `a, b, c`. Saved a byte inspired by using Dennis's subtraction method.\n```\n0>.-/\n```\n## Explanation\n```\n0>.-/\n -/ reduce argument over subtraction\n0>. greater of the reduction and 0\n```\n## Test cases\n```\n rem =: 0>.-/\n rem 3 3 4\n4\n rem 1 2 3\n2\n rem 1 5 3\n0\n rem\"1 > (3 3 4 ; 1 2 3 ; 1 5 3)\n4 2 0\n```\n---\nPreviously: (`a,c,b` input) `+/@}:-{:)`, `+/@(}:,-@{:)`\n[Answer]\n# Python, 25 bytes\n```\nlambda a,b,c:max(0,a-b+c)\n```\n[Answer]\n## PowerShell, ~~41~~ 38 bytes\n```\nparam($a,$b,$c)[math]::Max(0,$a+$c-$b)\n```\nPretty straightforward implementation of the [Pitot theorem](https://en.wikipedia.org/wiki/Pitot_theorem) (*thanks to Martin for remembering the name of it*).\nSaved 3 bytes by using the .NET `[math]::Max()` function.\n[Answer]\n# Jolf, 4 bytes\n```\n\\r0m4\n```\nReplace `\\r` with a literal return, or [try it here!](http://ethproductions.github.io/Jolf/#code=CjBtNA&input=WzMsIDQsIDRd) Explanation:\n```\n\\r0m4\n m4 anti-sum of implicit input\n\\r0 max of `0` and the anti-sum\n```\n[Answer]\n# Reng v.3.3, 33 bytes\n```\nii+i-:²1#x1ø\n:x²eq!vx1+#x\n ~n%2+<\n```\nTakes input like `a c b`. [Try it here!](https://jsfiddle.net/Conor_OBrien/avnLdwtq/)\nThe calculation is simple. `i` gets input, so `ii+` is `a + c`, and `i-` is then `(a + c) - b`. Very simple stuff.\nThe hard part is taking the max with `0`. \"What!? How could it be that hard?\" Well, I didn't implement inequality in Reng. So we'll have to use math!\n**Observation 1:** `max(a,b) = (a+b+|a-b|)/2`\n**Observation 2:** `max(a,0) = (a+|a|)/2`\n**Observation 3:** `|a| = Sqrt[a^2]`\n**Observation 4:** Reng doesn't have square roots, either. Nor does it have power. But knowing that we'll only be taking the square roots of perfect squares, we can use trial and error, starting at 1. That is, our algorithm can look like this:\n```\nx = 1 to a, iterate:\n if x * x == a break, return X\n```\nSince we always have `k` being a perfect square, this algorithm always terminates.\nSo, into the rest of the code explanation!\n```\nii+i-:²1#x1ø\n:x²eq!vx1+#x\n ~n%2+<\n```\n## part 1: initialization\nI've already explained how `ii+i-` works, so let's look at the rest of the line.\n```\n :²1#x1ø\n```\n`:` duplicates this number. The bottom number will be `a` in `(a + |a|)/2`. Now, we need to take the absolute value of the top value. We can do this using observations 3 and 4. `²` squares the top value, and `1#x` initializes our counter `x` with `1`. Then we go to the next line with `1ø`\n## part 2: square root loop\n```\n:x²eq!vx1+#x\n```\n`:` duplicates our maximum value `a` from the top of the stack (for the equality check). `x²` squares our counter `x` and `e` pushes a Boolean representing the equality of `x²` and `a`. If they are equal, `q!` breaks out of the loop by going down (`v`), leaving `|a|` on the stack. Otherwise, we increment `x` (`x1+`) and set `x` to that value (`#x`).\n## finalization\n```\n ~n%2+<\n```\n`<` redirects the program to look left. shhh it saves bytes. It's equivalent to this series of steps:\n```\n+2%n~\n```\n`+` adds the top two of the stack, thus implementing the first part of `(a + |a|)/2`. `2%` divides that sum by two (`%` is division here because `/` is a mirror). Lastly, we output this as a number (`n`) and terminates the program (`~`).\n[Answer]\n## JavaScript (ES6), 22 bytes\n```\n(a,b,c)=>a+c>b?a+c-b:0\n```\n`Math.max` is too long and there isn't a long enough common subexpression to deduplicate, so that's basically it. If a falsy value had been acceptable, then 21 bytes: `(a,b,c)=>a+c>b&&a+c-b`.\n[Answer]\n# Mathematica, 13 bytes\n```\nMax[##2-#,0]&\n```\nAnonymous function. Takes input in the order *b*, *a*, *c*. The `##2-#` is just some crazy `Sequence`craft that computes `#2+#3-#`. The `Max[..,0]` just takes the maximum of the result and 0.\n[Answer]\n## Pyke, 6 bytes\n```\n-+0]Se\n```\nExplanation:\n```\n+- - do the mathsy bit (a+c)-b\n 0] - create a list with [0, ^]\n Se - Get the maximum value\n```\n[Try it here!](http://pyke.catbus.co.uk/?code=-%2B0%5DSe&input=5%0A3%0A1)\n[Answer]\n## ><>, 7 bytes\n```\n-+:0)*n\n```\nInput assumed to be on the stack, in the order a, c, b.\nIt does c-b+a, and compares that with zero. Then it outputs either 0 or the answer before it terminates.\n[Try it online!](https://tio.run/##S8sszvj/X1fbykBTK@8/kFWmYGgAIs1BhCkA)\n[Answer]\n# MATLAB / Octave, 20 bytes\n```\n@(a,b,c)max(c-b+a,0)\n```\nAnonymous function that accepts the three inputs and returns the length of the fourth side. Can be called using `ans(a,b,c)`.\n[Demo with all test cases](https://ideone.com/YHALyX)\n[Answer]\n# Hexagony, 16\n```\n?{?>+'<'-{?/@.!<\n```\n[Try it online!](http://hexagony.tryitonline.net/#code=P3s_PisnPCctez8vQC4hPA&input=MSA1IDI)\nIn expanded form:\n```\n ? { ?\n > + ' <\n' - { ? /\n @ . ! <\n . . .\n```\nThis is actually a fairly simple program. First, we always execute the instructions in this order: `?{?'-{?/<'+` which just reads some values and computes `a-b+c`. Now if the value is positive, the `>` sends us north west and we bounce to the lower right `<` and then print the number (`!`) and exit (`@`).\nThe only really fancy part of the program is how it handles if the result was negative. If this happens, we move south west and execute: `'?`{` which actually attempts to read another integer after moving the memory pointer around a bit and we land back on the place where we read another integer. Since the read fails to find a value, it returns zero and because zero isn't positive we wrap to the upper edge of the hexagon in this configuration, so we hit `/a.replace(/./g,x=>i[x.charCodeAt()-97]||x)\n```\nTakes an string of lines `a` and a dictionary `i`.\n[Answer]\n## sh + coreutils, 16 bytes\n```\nread s;tr a-z $s\n```\n15 bytes if input is from a terminal:\n```\ntr a-z `sed 1q`\n```\n[Answer]\n# [CJam](https://sourceforge.net/projects/cjam/), ~~12~~ 8 bytes\n*4 bytes saved thanks to Dennis!*\n```\nl_$q\\@er\n```\n[**Try it online!**](http://cjam.tryitonline.net/#code=bF8kcVxAZXI&input=cXdlcnR5dWlvcGFzZGZnaGprbHp4Y3Zibm0KaGVsbG8KYnllIQppIGRvbid0IGtub3cu)\n### Explanation\n```\nl e# read a line\n_$ e# fancy way to obtain string \"abc...z\". Thanks to Dennis!\nq e# read the rest of input as a string with newlines\n\\@ e# swap, rotate\ner e# transliterate. Implicit display\n```\n[Answer]\n# [05AB1E](http://github.com/Adriandmen/05AB1E), 5 bytes\nCode:\n```\n[A¹‡,\n```\nExplanation:\n```\n[ # Start an infinite loop.\n A # Push the lowercase alphabet.\n ¹ # Push the first input (substitution map).\n ‡ # Transliterate. Since the arity of this function is 3 and there are only 2 values\n on the stack, it implicitly takes a line of input.\n , # Pop and print.\n```\nSo this continually reads a line of input and prints a line of input after. Uses **CP-1252** encoding. This is what I got with the console version:\n```\nD:\\Golfing\\05AB1E>C:\\Python34\\python.exe 05AB1E.py test.abe\nqwertyuiopasdfghjklzxcvbnm\nhello\nitssg\nwelcome\nvtsegdt\ngreetings, planet!\nukttzoful, hsqftz!\n```\nTrying this online might be a bit weird, since 05AB1E is trying to read another line of input, but there is none, so you need to kill it to receive output (doesn't work all the time). It *might* be a better idea to do this with the **console version** of 05AB1E. [Try it online!](http://05ab1e.tryitonline.net/#code=W0HCueKAoSw&input=cXdlcnR5dWlvcGFzZGZnaGprbHp4Y3Zibm0KaGVsbG8KYnllIQppIGRvbid0IGtub3cu).\n[Answer]\n# JavaScript 89\n```\nfor(i=prompt,x=i(),n='';p=i();n+=p.replace(/./g,m=>x[m.charCodeAt(0)-97])+\"\\n\");\nalert(n)\n```\n[Answer]\n# [MATL](https://github.com/lmendo/MATL), 14 bytes\n```\njXKx`jHY2KXEDT\n```\nThe program exits with an error after producing the correct output (allowed by default).\n[**Try it online**](http://matl.tryitonline.net/#code=alhLeGBqSFkyS1hFRFQ&input=cXdlcnR5dWlvcGFzZGZnaGprbHp4Y3Zibm0KaGVsbG8KYnllIQppIGRvbid0IGtub3cuCgoK)\n[Answer]\n# Ruby, ~~35~~ ~~31~~ 29 bytes\nCredit to @QPaysTaxes for the `$_` trick, I had assumed that reading more from the STDIN object `$<` would change that variable, but it doesn't.\n```\ngets\n$><<$<.read.tr('a-z',$_)\n```\n`String#tr` is basically a cipher substitution function, making things quite simple.\n[Answer]\n# Pyth, ~~34 Bytes~~ ~~31 Bytes~~ ~~29 Bytes~~ 27 Bytes\nSaved ~~3~~ ~~5~~ 7 bytes thanks to Kenny Lau\n```\njmsm?&J96@hQ-J97kdt\n```\n[Try it out!](http://pyth.herokuapp.com/?code=jmsm%3F%26%3CJCk123%3EJ96%40hQ-J97kdt&input=[%22qwertyuiopasdfghjklzxcvbnm%22%2C%22hello%22%2C%22bye!%22%2C%22i+don%27t+know.%22]&debug=0)\n[Answer]\n# Python 3, 50 bytes\n```\nlambda s,k:s.translate(dict(zip(range(97,122),k)))\n```\nOr if we really have to implement an infinite loop:\n# Python 3, 70 bytes\n```\nt=dict(zip(range(97,122),input()))\nwhile 1:print(input().translate(t))\n```\n[Answer]\n# Factor, 155 bytes\nThe logic is actually pretty simple, it's just constraining to the REPL requirement that costs.\n```\n[let \"abcdefghijklmnopqrstuvwxyz\" readln string>array bi@ zip :> T [ t ] [ T readln string>array [ dup T key? [ T at ] [ ] if ] map \"\" join print ] while ]\n```\nReadable single-function version (don't ever write code like this):\n```\n:: monolithic-repl ( -- )\n \"abcdefghijklmnopqrstuvwxyz\" readln string>array bi@ zip \n :> table\n [ t ] \n [ table readln string>array\n [ dup table key? \n [ table at ] [ ] if \n ] map\n \"\" join print \n ] while ;\n```\nReadable, *Factored* version:\n```\n:: cipher-print ( cipher-table -- )\n readln string>array\n [ dup cipher-table key? [ cipher-table at ] [ ] if ] map\n \"\" join print ;\n: cipher-get ( -- cipher )\n \"abcdefghijklmnopqrstuvwxyz\" readln\n string>array bi@ zip ;\n:: cipher-repl ( -- )\n cipher-get :> table\n [ t ] [ table cipher-print ] while ;\n```\n[Answer]\n## C++, 154 Bytes\n```\n#include \n#include \"string.h\"\nusing namespace std;\nvoid encript_string() {\nchar en[26],in[1024];\nstring s=cin.getline();\nstrcpy(en,s.c_str());\nwhile(1){\n s=cin.get_line();\n strcpy(in,s.c_str());\n int i=0,m=0;\n while(in[i] != 10) {\n m=in[i]-97;\n cout<\n i`¬v with \"cov\" inserted at the beginning.\n Implicit: output result of last expression, joined with newlines (-R)\n```\nAlternatively, you could do `7o28_îfie)h\"cov`, which does the same thing, except overwriting `cov` onto the beginning of the string instead of inserting it at the beginning.\n[Answer]\n# [Python 2](https://docs.python.org/2/), 37 bytes\n```\ns='covfef'\nexec\"s+=s[-2];print s;\"*21\n```\n[Try it online!](https://tio.run/##K6gsycjPM/r/v9hWPTm/LC01TZ0rtSI1WalY27Y4Wtco1rqgKDOvRKHYWknLyPD/fwA \"Python 2 – Try It Online\")\nMatches the text shown.\n---\n# [Python 2](https://docs.python.org/2/), 36 bytes\n```\ns='covfefe'\nexec\"print s;s+='?';\"*21\n```\n[Try it online!](https://tio.run/##K6gsycjPM/r/v9hWPTm/LC01LVWdK7UiNVmpoCgzr0Sh2LpY21bdXt1aScvI8P9/AA \"Python 2 – Try It Online\")\nPrints:\n```\ncovfefe\ncovfefe?\ncovfefe??\ncovfefe???\ncovfefe????\ncovfefe?????\ncovfefe??????\ncovfefe???????\ncovfefe????????\ncovfefe?????????\ncovfefe??????????\ncovfefe???????????\ncovfefe????????????\ncovfefe?????????????\ncovfefe??????????????\ncovfefe???????????????\ncovfefe????????????????\ncovfefe?????????????????\ncovfefe??????????????????\ncovfefe???????????????????\ncovfefe????????????????????\n```\n[Answer]\n## [Pyth](https://github.com/isaacg1/pyth), 29 bytes\n```\nVr4 25+\"cov\"+*/N2\"fe\"?%N2\"f\"k\n```\nExplanation:\n```\nVr 4 25 Loops variable N from 4 to 24 (excludes 25)\n */N2\"fe\" Repeats string \"fe\" N / 2 number of times \n ?%N2\"f\"k Concatenates \"f\" if N % 2 is 1 (odd), or an empty \n string if it is even (N % 2 is 0) \n + Concatenates strings\n```\n[Try it online!](https://tio.run/##K6gsyfj/P6zIRMHIVFspOb9MSVtL389IKS1VyV4VRCtl//8PAA \"Pyth – Try It Online\")\n[Answer]\n# [SOGL V0.12](https://github.com/dzaima/SOGL), ~~16~~ 15 [bytes](https://github.com/dzaima/SOGL/blob/master/chartable.md)\n```\n4'⁷Ν{ņcoļvƧfemo\n```\n[Try it Here!](https://dzaima.github.io/SOGLOnline/?code=NCUyNyV1MjA3NyV1MDM5RCU3QiV1MDE0NmNvJXUwMTNDdiV1MDFBN2ZlbW8_)\nExplanation:\n```\n4'⁷Ν push inclusive range from 4 to 24\n { for each do\n ņcoļv output in a new line \"cov\" (split into 2 commands of \"output 2 chars in a new line\" and \"output next char\" for a byte save)\n Ƨfemo output \"fe\" molded into the length of the current item\n```\n[Answer]\n# [C# (Mono)](http://www.mono-project.com/), 132 bytes\n```\nusing System.Linq;_=>{for(int i=0;i<21;)System.Console.WriteLine(\"cov\"+string.Concat(new int[4+i++].Select((n,j)=>j%2<1?\"f\":\"e\")));}\n```\n[Try it online!](https://tio.run/##TY5PS8QwEMXv@RQhICRUi7t4Mm1FvCqIe/AgIjE7lSnZGWyyK7L0s9d03S77TvPe/Pv5eLVh4nEbkb7k6jcm2Fhx7spHpG8rhA8uRvks9kJmxeQSerljXMsnh6TNIf5vTrr3CZkq/uzAp0a2sh4/6mbfcq@RksT62mK1XFhz/PLAFDlA@dpjgvwStPK8U0VMfWaZ2t4lTfAj8/rbTYFF8V6uIOTrWtNlZ@qmu1hWizvVqlsFyhhjh3Gmyfxz2WrahmDsKZh0MjPGC7j1geI4OIhh/AM \"C# (Mono) – Try It Online\")\n[Answer]\nTotally valid answer which matches the specs/rules.\n# PowerShell, 25 Bytes. [Try it online!](https://tio.run/##K8gvTy0qzkjNyfn/Xyk5vywtNS1VydpCT8/Ioka1Wt1eXUslvvb/fwA \"PowerShell – Try It Online\")\n```\n\"covfefe\";8..28|%{'?'*$_}\n```\nOR (same byte count)\n```\n0..21|%{'covfefe'+'?'*$_}\n```\nAs intended answer which matches the example output.\n# PowerShell, 44 Bytes. [Try it online!](https://tio.run/##K8gvTy0qzkjNyfn/XyXZVik5vywtNU3J2kBPz8igRrVaAyiokqytoZ6qrqOepq4ZrRKvahSrWfv/PwA \"PowerShell – Try It Online\")\n```\n$c=\"covfef\";0..20|%{($c=$c+('e','f')[$_%2])} \n```\nUgly assignment at the beginning, i'm sure there's some that can be saved here.\n[Answer]\n# [Japt](https://github.com/ETHproductions/japt/), ~~20~~ 18 bytes\n```\n`¬vfef`\n21ÆU±gJÉ÷\n```\n[Test it](http://ethproductions.github.io/japt/?v=1.4.5&code=YKx2ZmVmYAoyMcZVsWdKycO3&input=)\n16 bytes, if we can return an array.\n```\n`¬vfef`\n21ÆU±gJÉ\n```\n[Answer]\n# [Python 2](https://docs.python.org/2/), ~~53~~ 52 bytes\n```\nf=lambda n=21:n*' 'and'\\ncovf'+('ef'*12)[:-n]+f(n-1)\n```\n[Try it online!](https://tio.run/##K6gsycjPM/r/P802JzE3KSVRIc/WyNAqT0tdQT0xL0U9Ji85vyxNXVtDPTVNXcvQSDPaSjcvVjtNI0/XUPN/QVFmXolCmobmfwA \"Python 2 – Try It Online\")\n[Answer]\n# [Jelly](https://github.com/DennisMitchell/jelly), 17 bytes\n```\n⁾feẋ12“cov”;;\\ṫ7Y\n```\n[Try it online!](https://tio.run/##ASQA2/9qZWxsef//4oG@ZmXhuosxMuKAnGNvduKAnTs7XOG5qzdZ//8 \"Jelly – Try It Online\")\n[Answer]\n# [Husk](https://github.com/barbuz/Husk), 15 bytes\n```\n↑21↓7ḣ+¨¢√¨¢\"fe\n```\n[Try it online!](https://tio.run/##yygtzv7//1HbRCPDR22TzR/uWKx9aMWhRY86ZoEopbTU//8B \"Husk – Try It Online\")\nNB: `¨¢√¨` is the compressed strind `\"cov\"`\n[Answer]\n# Pyth, 33 bytes\n`V21+++\"cov\"*\"fe\"2*\"fe\"s/N2*\\f%N2`\nTry it here: \n[Answer]\n# [Retina](https://github.com/m-ender/retina), 27 bytes\n```\ncovf12$*\n1\nef\n.\n$`¶\nG`.{7}\n```\n[Try it online!](https://tio.run/##K0otycxL/P@fKzm/LM3QSEWLy5ArNY1Lj0sl4dA2LvcEvWrz2v//AQ \"Retina – Try It Online\") Explanation:\n```\ncovf12$*\n```\nAdd `covf` plus 12 `1`s.\n```\n1\nef\n```\nChange each `1` to `ef`. This results in the last line of the desired output, but with an extra `f`.\n```\n.\n$`¶\n```\nReplace the string with a list of all of its proper prefixes.\n```\nG`.{7}\n```\nDelete the prefixes that are too short.\n[Answer]\n# [C (gcc)](https://gcc.gnu.org/), ~~77~~ ~~75~~ 74 bytes\n```\nf(i,j){for(i=4;i++<25;)for(printf(\"\\ncov\"),j=i;--j;)putchar(\"ef\"[i-j&1]);}\n```\n[Try it online!](https://tio.run/##FccxCoUwDADQvaeQDpKgHZT/p@hJ1EGC0RSsUtRFPHvFtz12M3NKAlp6vGWLoO2PtCia@k/4fY8aDgHbB94ui6VvlZzzhPt58DJGsJPYTp3PqwHpSeuoAdDcJssEkMyTXg \"C (gcc) – Try It Online\")\n[Answer]\n# [Python 3](https://docs.python.org/3/), 61 bytes\n```\ndef f(n=20):\n\tprint(' '*n+('covf'+'ef'*12)[:~n])\n\tif n:f(n-1)\n```\nnot the shortest, but prints triangle without e/f vertical adjacency\n[Try it online!](https://tio.run/##K6gsycjPM/7/PyU1TSFNI8/WyEDTiouzoCgzr0RDXUFdK09bQz05vyxNXVs9NU1dy9BIM9qqLi9Wk4szM00hzwqoRddQ83@ahuZ/AA \"Python 3 – Try It Online\")\n[Answer]\n# [Perl 5](https://www.perl.org/), 45 bytes\n```\n$_=\"covfef\n\";eval's/((.).)$/$1$2/;print;'x 20\n```\n[Try it online!](https://tio.run/##K0gtyjH9/18l3lYpOb8sLTWNS8k6tSwxR71YX0NDT1NPU0VfxVDFSN@6oCgzr8RavULByOD/fwA \"Perl 5 – Try It Online\")\n[Answer]\n# [Perl 5](https://www.perl.org/), 39 bytes\n```\n$b=covfef;say$b.=substr$b,-2,1for 1..21\n```\n[Try it online!](https://tio.run/##K0gtyjH9/18lyTY5vywtNc26OLFSJUnPtrg0qbikSCVJR9dIxzAtv0jBUE/PyPD//3/5BSWZ@XnF/3V9TfUMDA0A \"Perl 5 – Try It Online\")\n[Answer]\n**Ruby - 53 chars**\n```\ns='covfef';21.times{|i|puts s +=(i.odd? ? 'f' : 'e')}\n```\n*Note:* This is the OP's answer, there must be better one's out there.\n]"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":138,"numItemsPerPage":100,"numTotalItems":13986,"offset":13800,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc1NjI4Njg3NCwic3ViIjoiL2RhdGFzZXRzL1ZhdHNhRGV2L2NvZGVnb2xmIiwiZXhwIjoxNzU2MjkwNDc0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.BC-OTO9aMbWEvzXesEZypRRBKJwNm8G1lF9iJ4AopbJZM1r55ja6xtCSIqhnlaODc2aIIx02jCYv4NRrkkucAQ","displayUrls":true},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">