well, we're also spending our effort in raising the privilege levels to where they should've been since a long time ago :P (the topic has been inactive for some time over meta, but I don't think the efforts are dead yet)
10-character golfing language
language-design test-battery
{{{rewriting}}}
Your task is to design and implement a new golfing language. The catch: it must only have 10 significant characters as commands.
Design and Implementation rules
Your language should have the following characteristics:...
I've revised this question a bit, some feedback on the spec part would be nice
"An Ideal Observer Model of Visual Short-Term Memory Predicts Human Capacity–Precision Tradeoffs"
I mentioned this in the Primes and Squares room. In an every shorter summary, the subject saw N differently-colored dots briefly on a screen, then a single colored dot, and was then asked which direction that dot had moved relative to its position in the first image.
It's like lossy compression: more dots to remember, and more randomness per dot, equals less precision. Figure out what the tradeoff is, and you've got memory capacity, assuming that the person learns to perform the task optimally over time.
I wrote this to try to get a factor of a unary number. Was expecting output to be 11 or maybe 11111111; got 9. What gives? It's a replacement stage, isn't it? Where's the decimal number coming from?
@ASCII-only idea: func download(auto path: Path) and lets say path has constructors (file: String) and (existingPath: Path, suffix: String) you can do download(existingPath: path, suffix: "hi") and it will implicitly act as if you did download(Path(...))
@Downgoat i was thinking if the struct can be passed to constructor then it's automatically constructed. but i guess {foo, bar, baz: quux} isn't a thing?
Challenge
Given a positive integer \$N\$, repeat each of its digits \$d_1, d_2, d_3, \cdots, d_n\$ a number of times corresponding to its position in \$N\$. In other words, each digit \$d_k\$ should be repeated \$k\$ times (for each \$1\le k\le n\$, 1-indexed), thus creating the new number:
$$\...
This is simple challenge to make a random function that maps from the integers 1...n to 1...m. The mapping must be uniform. That is an element of 1...n must have an equal chance of being mapped to any of the integers in 1...m. The mapping of each integer in 1...n must be independent as well.
Y...
Pleasinortmanteaus
code-golf string natural-language
A portmanteau word is a combination of two words that takes a part of each word and forms a single new word. For example, lion + tiger => liger.
Let's write a program to generate portmanteaus from a pair of input words. Computers aren't the ...
CMC: given positive integers N and R, find the pair of positive integers K and C, K×(c^R + c^(R-1) + c^(R-2) + ... + c^0) = N, that have the smallest sum
Black Box Trigonometry code-challengetrigonometryfunction
Write a program that can distinguish the following 12 trigonometric functions: sin,
cos,
tan,
asin,
acos,
atan,
sinh,
cosh,
tanh,
asinh,
acosh,
atanh.
Your program is given one of the above functions as black box and should output one o...
"What is a list" meta question turns out to be more complex than I expected.
@NathanMerrill: yes, your head and tail make 1 a proper list of all square numbers. But your list implementation works only for that specific list. It's like creating a new language that solves a specific challenge in 1 (or 0) bytes. Boring, but valid. — nimi23 hours ago
(that is: it's possible to abuse the format to make the program shorter.)
Because I expect that if it's overused (and boring) it will be made a loophole, and it's appears to be very unobservable.
(this came up in golfing a sed expression for creating a string that is N characters long, I've since realised that there is the trivial K=1 and C=0 and used that for my answer)
I've just been knocked out in Python... I was solving Happy numbers and was quite happy with my 85 byter, but right before submitting mmy answers, I've seen that most people have 58 :c
@orlp Yeah, I've mostly stayed away from the challenges where that matters. It also means for cool perl 6 features that you dont see here. I can't argue for the quality of the problems either
CMC: Given an integer N, yield an array of integers A = [...s[i], b[i], e[i]...] such that sum(s[i]*b[i]^e[i] for all i) = N. Your score is the lengths of the arrays resulting from N = 2136894800297704 and N = 32032411679864578048. Note that b[i] cannot equal N
This is the followup challenge from this one, if you're confused please check that one out first.
First, let \$m(s, k)\$ be the number of cache misses a sequence \$s\$ of resources accesses would have assuming our cache has capacity \$k\$ and uses a first-in-first-out (FIFO) ejection scheme wh...
Challenge
Given a positive integer \$N\$, repeat each of its digits \$d_1, d_2, d_3, \cdots, d_n\$ a number of times corresponding to its position in \$N\$. In other words, each digit \$d_k\$ should be repeated \$k\$ times (for each \$1\le k\le n\$, 1-indexed), thus creating the new number:
$$\...
This is simple challenge to make a random function that maps from the integers 1...n to 1...m. The mapping must be uniform. That is an element of 1...n must have an equal chance of being mapped to any of the integers in 1...m. The mapping of each integer in 1...n must be independent as well.
Y...
Pleasinortmanteaus
code-golf string natural-language
A portmanteau word is a combination of two words that takes a part of each word and forms a single new word. For example, lion + tiger => liger.
Let's write a program to generate portmanteaus from a pair of input words. Computers aren't the ...
Black Box Trigonometry code-challengetrigonometryfunction
Write a program that can distinguish the following 12 trigonometric functions: sin,
cos,
tan,
asin,
acos,
atan,
sinh,
cosh,
tanh,
asinh,
acosh,
atanh.
Your program is given one of the above functions as black box and should output one o...
This is the followup challenge from this one, if you're confused please check that one out first.
First, let \$m(s, k)\$ be the number of cache misses a sequence \$s\$ of resources accesses would have assuming our cache has capacity \$k\$ and uses a first-in-first-out (FIFO) ejection scheme wh...
