Search Results

Regex (PCRE2), 203 193 177 181 bytes /((?|^()|^(?:.(?=.* (\2.)))+){2}(?(8)(?=\8$)(?|()|(?:(?6)(?=.+((?6)\3)\7$))++){2}((?6)|(?!\5)7())\3(?=\7$)|o([^o7_])+o)(?|()|\7(?:.(?=.* .*(.\7)))+){2} (?=\2(.*))) …

Regex (Perl / Java / PCRE2 v10.34+), 30 29 27 bytes ^(?!.*:(x(\2?+:.*\b)?){7}:) Takes its input in unary, as a concatenation of strings of x characters whose lengths represent the numbers, separated …

Perl 5, 34 + -p flag = 35 bytes Full program. Takes the simple regex pattern, followed by string to match against, from stdin as two separate lines, then loops and does it again, until EOF is encount …

Regex (ECMAScript), 64 62 bytes ^(?=(x((x{14})(x+)))(?=(\1*)\4\2*$)(\1*$\5))\6\3?(?!(xx+)\7+$) Try it online! Takes its input in unary, as a sequence of x characters whose length represents the numbe …

Regex (ECMAScript), 69 67 bytes The input is in the form of a comma-delimited list of nonnegative integers in decimal. ^(?=.*\b(\w+\b).*,\1\b)(?!(.*\b\1\b){3}|.*\b(?!\1\b)(\w+\b).*,\3\b) Try it onlin …

Regex (ECMAScript), 35 33 32 bytes -2 bytes thanks to H.PWiz; the explanation for why this worked was more complicated -1 bytes by returning to the original algorithm (with its simple explanation), by …

Regex (ECMAScript), 194 171 167 164 155 145 142 107 bytes -35 bytes (142 → 107) thanks to H.PWiz; this is a complete reimplementation. The primary sources of bytes saved are using tail = floor((tail + …

Regex (ECMAScript), 61 bytes ^(?=(|x*)\1*(?=\1\b)(?!(((x+)x+)(?=\3+,)\3*\4)\2+,)(x*)).*,\5 Try it online! Takes \$n\$ and \$B\$ from input in unary as strings of xs whose length represents the number …

Regex (POSIX ERE / RE2 or better), 13 10 bytes x(| |. .)x Try it online! - POSIX ERE Try it on regex101 - RE2 Try it online! - ECMAScript Try it online! - .NET The problem statement didn't say anywhe …

Regex (ECMAScript 2018 / Pythonregex / .NET), 20 bytes Takes the two strings in joined format, delimited by a single newline. That is why there are two newlines in the regex itself (saving 2 bytes com …

Regex (ECMAScript), 37 bytes Warning: Despite this regex's small size, it contains a major spoiler. I highly recommend learning how to solve unary mathematical problems in ECMAScript regex by figuring …

Regex (Perl / PCRE / Boost / Pythonregex) + /i flag, 24 bytes ^((.*?[aeiou]){2})*+(?2) Returns a match if odd; returns no match if even. Try it online! - Perl Try it online! - PCRE Try it online! - B …

Regex (ECMAScript / Perl / PCRE / Python / .NET), 66 61 bytes ^(?!((?=(x{10})*(x*))(^|(?=(x*)(\5{9}x*))\6)+){2}\B\2*\3$)|^$ Takes its input in unary, as the length of a string of xs. Try it online! - …

Python 3 (with python-chess) Number of characters: 173 168 150 130 -5 characters thanks to Unrelated String import io,chess.pgn as c g=c.read_game(open(0)) b=g.board() for m in g.mainline_moves():b.pu …

See also my unary regex answer. Although other posts have already used a regex that take decimal input, this post provides a unified presentation, and outgolfs some of the previous posts (including a …