What is the Ultraradical
The ultraradical, or the Bring radical, of a real number \$a\$ is defined as the only real root of the quintic equation \$x^5+x+a=0\$.
Here we use \$UR(\cdot)\$ to denote the ultraradical function. For example, \$UR(-100010)=10\$, since \$10^5+10-100010=0\$.
Challenge
...
Duck, duck, gone!
Here is the (quite childish) Five little ducks song(it is not long):
Five little ducks went out one day,
over the hills and up away.
Mother Duck said, "Quack Quack Quack Quack",
but only four little ducks came back.
Four little ducks went out one day,
over the hills and up aw...
Convert a string containing digits as words into an integer, ignoring leading zeros.
Examples
"four two" -> 42.
"zero zero zero one" -> 1.
Assumptions
Submissions can assume that:
The input string is comprised of space-separated digit words.
All words are valid (in the range "zero".."nine...
Let G be a directed graph whose edge-weights are rational numbers. Give an efficient algorithm to check if G has a directed cycle whose product of edge-weights is greater than 1. Assume that addition/multiplication/division of rational numbers takes unit time.
CMC: In a string of text, change the word "less" to "fewer" if the next word ends in an s. You can assume that the word "less" is preceded by a space, that a single space separates the two words, and that they only contain lowercase letters, but the rest of the sentence might contain other printable characters. Example: "I have less milk." (unchanged); "ZZ is 2 less bytes." -> "ZZ is 2 fewer bytes."
@Neil But if I use space rather than \b then I need a space in the replacement string too, so it ends up same length. Then I'd rather handle more cases with \b.
@DJMcMayhem We should make a challenge about the "vim distance" between two strings: It is defined as the minimum number of keystrokes needed to transform the first string into the second. Wold that make sense?
Title: Transposition
Given a set of notes, the key those notes are in, and a target key; output the notes transposed into the new key.
The complete set of input notes for this challenge will use the English naming convention, and so are as follows:
Ab,A,A#,Bb,B,C,C#,Db,D,D#,Eb,E,F,F#,Gb,G,G#
...
One other problem: it would be very hard to make it self contained since there are hundreds of commands (maybe even in the range of a thousand if you count ex commands) and they get updated with newer versions sometimes
Python 2, 71 70 bytes
-1 thanks to ovs (use find in place of index)
lambda s:int(''.join(`'rothuvsein'.find((w*3)[6])`for w in s.split()))
Try it online!
Several answers appear to be using this trick, whatever it is, but I can't for the life of me figure out what they're doing
Sandbox
French License Plates
French license plates come in a sequential order, following a specific pattern of numbers and letters : AB-012-CD
Challenge
Write a program or function that, for a given number, outputs the corresponding french license plate number. Your program should not handle...
Byte-sized Huffman Coding (WIP)
coding-challenge compression
Huffman codings are a method to compress data with certain frequency properties, usually text. Normally, these operate on bits rather than bytes, but this challenge will instead operate on whole bytes instead. Since you wouldn't get a...
Duck, duck, gone!
Here is the (quite childish) Five little ducks song(it is not long):
Five little ducks went out one day,
over the hills and up away.
Mother Duck said, "Quack Quack Quack Quack",
but only four little ducks came back.
Four little ducks went out one day,
over the hills and up aw...
Convert a string containing digits as words into an integer, ignoring leading zeros.
Examples
"four two" -> 42.
"zero zero zero one" -> 1.
Assumptions
Submissions can assume that:
The input string is comprised of space-separated digit words.
All words are valid (in the range "zero".."nine...
Let G be a directed graph whose edge-weights are rational numbers. Give an efficient algorithm to check if G has a directed cycle whose product of edge-weights is greater than 1. Assume that addition/multiplication/division of rational numbers takes unit time.
Title: Transposition
Given a set of notes, the key those notes are in, and a target key; output the notes transposed into the new key.
The complete set of input notes for this challenge will use the English naming convention, and so are as follows:
Ab,A,A#,Bb,B,C,C#,Db,D,D#,Eb,E,F,F#,Gb,G,G#
...
Python 2, 71 70 bytes
-1 thanks to ovs (use find in place of index)
lambda s:int(''.join(`'rothuvsein'.find((w*3)[6])`for w in s.split()))
Try it online!
Sandbox
French License Plates
French license plates come in a sequential order, following a specific pattern of numbers and letters : AB-012-CD
Challenge
Write a program or function that, for a given number, outputs the corresponding french license plate number. Your program should not handle...
Byte-sized Huffman Coding (WIP)
coding-challenge compression
Huffman codings are a method to compress data with certain frequency properties, usually text. Normally, these operate on bits rather than bytes, but this challenge will instead operate on whole bytes instead. Since you wouldn't get a...
