How many partitions contain all perfect squares? code-golf mathematics number
Given a number, determine how many ways the number can be partitioned such that each partition only contains square numbers.
This was originally a CMC, but the only answer was my quite long Jelly answer, so hopefully ...
15
Users with 3,500 rep (or 15,000 if when we get a site-design) can protect challenges. This makes it so that users who have not earned 10 rep on the site can not answer.
As a user with this privilege, I have no idea when it would be appropriate to use. This is because the idea of "protecting ques...
RProgN 2, 3 + 3 = 6 bytes
First program:
0
1
Try it online!
Second program:
1
0
Try it online!
-2 thanks to Martin Ender.
Concept
Write a program that outputs code in its programming language. That code, when executed, must output the original program.
Rules
Since this is a cheating quine, you can read the original source code.
First output program must be in the same language as the original program.
You may no...
Lorum Ipsum Generator
popularity-constest string
Lorum Ipsum is placeholder text used when preparing layout without wanted to have content already filled.
One of it's key features over using some arbitrary text is that it is nonsense.
It isn't even valid latin (though it is close).
This preven...
When dealing with list input in C, as in this question, is it acceptable to add extra argument to indicate the length of the list?
It does give advantages because other language needs functions like len(M), but I cannot figure out a simple way to represent such a list in C.
If it is not accepta...
Number Named Regex Groups
code-golfstring
Using named matching groups is often easier to understand than numbering groups but takes up more bytes. Given a regular expression as specified below, your program or function must convert named groups to numbered groups.
Task
These specifications ...Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
1
Given a positive integer, find its smallest positive integer multiple which is a run of 9 followed by an optional run of 0. In other words, find its smallest positive integer multiple which is matched by the regex /^9+0*$/.
For example, if the given positive integer is 2, then return 90, since 9...
Generate a Chernoff face for two variables.
The input is two integers between 0 and 10, they can be imported as a list or string.
The output is the figure. The figure should be in the tradition and style of Chernoff faces. It's up to the golfer to find two suitable expressions of the variable...