For instance, C.SE has three mods that are doing 99% of the work, out of five mods altogether. But really, we now have a community of reviewers that do like 80-90% of the total moderation work. So it's fairly easy right now (which is awesome).
Integers, Assemble!
code-golfgridnumbertiling
Your task is to assemble the integers from 1 to N (given as input) into a rectangle of width W and height H (also given as input). Individual numbers may be rotated but have to be placed into the rectangle horizontally or vertically.
Here is an exa...
@MartinEnder perhaps say "Individual numbers may be rotated and flipped" because when I think rotation I think 90º rotation. when I think flip I think 180º
@MartinEnder why do you allow for 360 degree rotation of numbers? IMO, its more complicated that way, and I don't think people are actually going to do more than 90 degrees?
In the panel, there's a kind-of "Start" menu, an application launch bar to serve the goal of a quick launch bar, a task bar (window list), a keyboard layout switcher, a number of other applets, a system tray, a digital clock and a "Minimise All Windows" button.
@MartinEnder nah, I'd just allow the crossword 2. Alternatively, you could allow all of them, but I certainly wouldn't have all 4 in your example. It definitely confused me when I was trying to find the 12
step-count where the challenge is to create a program that will solve the challenge using as few steps as possible. Steps defined as assignments, each step in a map, for loop, while, other distinct statements.
I have a quite simple challenge idea but I don't know if i can explain well. On A033307; given inputs n and m, output how many m's on the first n numbers. Examples: 1,1->1, 1,2->0, 2,2->1, 10,1->2 i cant haz bezt engrishes so i don't want to write it on the sandbox
but then a) what's a token, b) this is ripe for abuse because many languages have ways to work with their own tokens so that you can store an arbitrary amount of information in one token.
the only way to really make the idea work is define a toy language to be used for your problem where you can clearly define that a token is and where the information content of tokens is limited
@Sherlock9 or 2D languages. or languages without explicit looping constructs. or declarative languages. the core problem of these language-unifying scoring mechanisms is that they assume too much about what concepts a language must have.
@MartinEnder i took the picture 4K, but after uploading to Facebook i removed it from my phone. Facebook made its optimizations to the image, and its about 20 pixels now.
In graph theory, an n-dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symbols. It has mn vertices, consisting of all possible length-n sequences of the given symbols; the same symbol may appear multiple times in a sequence. If we have the set of m symbols
S
:=
{
s
1
,
…
,
s
m
}
{\displaystyle S:=\{s_{1},\dots ,s_{m}\}}
then the...
@MartinEnder If I've understood correctly, for the integers assemble challenge having only 2 of the 4 rotations would be equivalent since there is no overlap (no sharing of digits between numbers). For an overlapping challenge I'd like to see all 4 rotations, but for isolated numbers it doesn't seem to matter
You are given N cheesecakes to distribute among M groups of children.
Each of these M groups contain(not necessarily) different number of children - m1, m2, m3 .... mm
Your Goal
Ensure distribution where the largest number of children sharing a cheesecake in a group is kept minimum and return ...
Definition
From the description on OEIS A006345:
To find a(n), consider either a 1 or a 2. For each, find the longest repeated suffix, that is, for each of a(n)=1,2, find the longest sequence s with the property that the sequence a(1),...,a(n) ends with ss. Use the digit that results in the ...
I like that flexibility. The only problem it caused me was making me wonder if I'd misread and overlaps were permitted (even though it's clear they are not from the number of digits in total)
@MartinEnder i took the picture 4K, but after uploading to Facebook i removed it from my phone. Facebook made its optimizations to the image, and its about 20 pixels now.
@MartinEnder not sure how to deal with tiebreakers. I've got 10K words, which should stop brute forcing, but the optimal solution might still be found. I'm debating between code-golf or first-posted as a tiebreaker
@NathanMerrill if you make the test case hard enough, first posted seems fine and if it turns out to be too small you could reserve the right to use a larger test case
A compound word is a word that contains 2 or more words in it. We can do better than that, though. We need you to create 1 (nonsensical) word that contains every word.
However, we want this word to be as short as possible. We can use overlapping letters to achieve this.
For example, if you...
I was curious why does it permit users to close their own question. What is the rational behind this? Is there any reason a user should be allowed to do this, and why does it still take multiple votes to close a question as a duplicate if the OP decides to close there own question.
@DrGreenEggsandIronMan I don't think this challenge is natural-language, because we aren't doing anything with the language itself (I could have used random numbers if I wanted to)