Many Happy Returns!
I'm not sure whether to make this code-golf or code-challenge.
Write a function that when it returns, it returns an extra frame up the stack. In other words, functions usually return directly to their callers; however, here the function should return directly to its calle...
MCDI: Make and Change Directory into
Input: A string consisting of only alphanumeric characters, whose length does not exceed 255. It is given as string input, through STDIN on a single line, through ARGV, etc.
Effect: If a directory with the given name does not exist in the current directory, ...
u\{0(\d*)(#*)\}/u{$1mult{##########}{$2}}/u\{1(\d*)(#*)\}/u{$1mult{##########}{$2}#}/u\{2(\d*)(#*)\}/u{$1mult{##########}{$2}##}/u\{3(\d*)(#*)\}/u{$1mult{##########}{$2}###}/u\{4(\d*)(#*)\}/u{$1mult{##########}{$2}####}/u\{5(\d*)(#*)\}/u{$1mult{##########}{$2}#####}/u\{6(\d*)(#*)\}/u{$1mult{##########}{$2}######}/u\{7(\d*)(#*)\}/u{$1mult{##########}{$2}#######}/u\{8(\d*)(#*)\}/u{$1mult{##########}{$2}########}/u\{9(\d*)(#*)\}/u{$1mult{##########}{$2}#########}/u\{(#*)\}/$1/mult\{(#*)#\}\{(.*?)}/mult{$1}{$2}$2/mult\{\}\{.*?\}//u{512}
Wikipedia offers free copies of all available content to interested users. These databases can be used for mirroring, personal use, informal backups, offline use or database queries (such as for Wikipedia:Maintenance). All text content is multi-licensed under the Creative Commons Attribution-ShareAlike 3.0 License (CC-BY-SA) and the GNU Free Documentation License (GFDL). Images and other files are available under different terms, as detailed on their description pages. For our advice about complying with these licenses, see Wikipedia:Copyrights.
== Offline Wikipedia readers ==
Some of the many...
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
u\{0(\d*)(#*)\}/u{$1mult{##########}{$2}}/
u\{1(\d*)(#*)\}/u{$1mult{##########}{$2}#}/
u\{2(\d*)(#*)\}/u{$1mult{##########}{$2}##}/
u\{3(\d*)(#*)\}/u{$1mult{##########}{$2}###}/
u\{4(\d*)(#*)\}/u{$1mult{##########}{$2}####}/
u\{5(\d*)(#*)\}/u{$1mult{##########}{$2}#####}/
u\{6(\d*)(#*)\}/u{$1mult{##########}{$2}######}/
u\{7(\d*)(#*)\}/u{$1mult{##########}{$2}#######}/
u\{8(\d*)(#*)\}/u{$1mult{##########}{$2}########}/
u\{9(\d*)(#*)\}/u{$1mult{##########}{$2}#########}/
u\{(#*)\}/$1/mult\{(#*)#\}\{(#*)}/mult{$1}{$2}$2/mult\{\}\{.*?\}//
sub\{(#*)#\}\{(#*)#\}/sub{$1}{$2}/
sub\{(#*)\}\{\}/$1/
sub\{\}\{(#*)\}/$1/
factorial\{(#*)#\}\{((?:#+,)*)(#+),(#+)\}/factorial{$1}{$2$3,$4,$3$4}/
factorial\{(#+)\}\{\}/factorial{sub{$1}{##}}{#,#}/
factorial\{(\d+)\}/factorial{u{$1}}{}/
factorial\{\}\{([#,]*)}/$1/
factorial{5}user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
user165474
u\{0(\d*)(#*)\}/u{$1mult{##########}{$2}}/
u\{1(\d*)(#*)\}/u{$1mult{##########}{$2}#}/
u\{2(\d*)(#*)\}/u{$1mult{##########}{$2}##}/
u\{3(\d*)(#*)\}/u{$1mult{##########}{$2}###}/
u\{4(\d*)(#*)\}/u{$1mult{##########}{$2}####}/
u\{5(\d*)(#*)\}/u{$1mult{##########}{$2}#####}/
u\{6(\d*)(#*)\}/u{$1mult{##########}{$2}######}/
u\{7(\d*)(#*)\}/u{$1mult{##########}{$2}#######}/
u\{8(\d*)(#*)\}/u{$1mult{##########}{$2}########}/
u\{9(\d*)(#*)\}/u{$1mult{##########}{$2}#########}/
u\{(#*)\}/$1/
d\{((#{10})*)(\d*)\}/d{over10{$1}0$3}/
d\{((#{10})*)#(\d*)\}/d{over10{$1}1$3}/
d\{((#{10})*)##(\d*)\}/d{over10{$1}2$3}/
d\{((#{10})*)###(\d*)\}/d{over10{$1}3$3}/
d\{((#{10})*)####(\d*)\}/d{over10{$1}4$3}/
d\{((#{10})*)#####(\d*)\}/d{over10{$1}5$3}/
d\{((#{10})*)######(\d*)\}/d{over10{$1}6$3}/
d\{((#{10})*)#######(\d*)\}/d{over10{$1}7$3}/
d\{((#{10})*)########(\d*)\}/d{over10{$1}8$3}/
d\{((#{10})*)#########(\d*)\}/d{over10{$1}9$3}/
d\{over10\{\}(\d*)\}/$1/
over10\{(#*)(#{10})(:(#*))?\}/over10{$1:sub{$2}{#########}$4}/
over10\{#{0,9}(:?(#+))}/$2/
mult\{(#*)#\}\{(#*)}/mult{$1}{$2}$2/mult\{\}\{.*?\}//
sub\{(#*)#\}\{(#*)#\}/sub{$1}{$2}/
sub\{(#*)\}\{\}/$1/
sub\{\}\{(#*)\}/$1/
fibonacci\{(#*)#\}\{((?:#+,)*)(#+),(#+)\}/fibonacci{$1}{$2$3,$4,$3$4}/
fibonacci\{(#+)\}\{\}/fibonacci{sub{$1}{##}}{#,#}/
fibonacci\{(\d+)\}/fibonacci{u{$1}}{}/
fibonacci\{\}\{(#*,)+(#+)}/d{$2}/
fibonacci{12}user165474
user165474
user165474
Given an integer, calculate its score as described below.
If the integer input happens to be prime then the largest digit in the number will be added to the score otherwise the smallest digit will be subtracted from the score to produce the final result.
Example
Here's an example of calculati...user165474
JRegex does not seem to support recursive matching, so I suggest you just use java.util.regex and set a limit upon the number of levels of nesting.
For example, to allow up to fifty levels of nesting, with an 'unlimited' number of bracket pairs on each level (except the deepest), you could use
...
So, I found this image. I feel like it wants something
You might wanna go ahead and download the image, because it will be useful to be able to scribble around on the image for counting and stuff. It won't mind
What does this image want?
P.S. The puzzle is all in the image. It knows to tell ...
