normal people see the letter d followed by the word list
I see "haha that's a funny mispelling of dlosc"
Stop posting about code golf! I'm tired of seeing it! My friends on SE send me code golf, on discord it's code golf. I was in a chatroom right, and allll of the messages were just code golf stuff. I showed an esolang to a friend and I said "when the program is golfed". I looked at a Java program and I go "that's a bit verbose". I looked at a dlist declaration, and I think of the Pip creator and I go "dlist? more like DLOSC!" AAAAAAAAAAAAAAAAAAAAAHHHHHHHHH
Find the largest sum such that no two elements are touching
Inspired by this (off topic) post
Given an array of numbers, find the largest sum over a subset not containing two consecutive elements
[1,2,3,4] -> 6 // [_,2,_,4]
[1,2,3,4,5] -> 9 // [1,_,3,_,5]
[1,1,0,0,1,0,0,1] -> 3 ...
Calculate NDos-depth of given integer
Objective
Given a nonnegative integer, calculate its NDos-depth as defined below, and output it.
NDos' numeral system
The concept of NDos-depth comes from the numeral system I made. It represents every nonnegative integer by a nested list, as follows:
Given...
@mousetail you'd need to raise the rep requirement for editing privileges then. Because people could otherwise farm rep with edits they apply without any approval
That, or a system where you can opt into having it peer reviewed
Which would add more work to review queues on other sites
MCA Live transfer Leads offer instant connections between businesses and lenders. Real-time engagement ensures tailored solutions, while efficient qualification saves time and resources. This streamlined approach accelerates the funding process, driving business growth and success. With MCA live ...
CMC Output every string with the following rules: Consist only of A, B, C, D, and E. B and D can only appear after A, B, or C and A, C, and E can only appear after D and E.
The mistake I discovered yesterday is that I actually can represent an uneven number of left vs right rhombs, which is very odd but it didn't seem to cause any issues for a while so I thought maybe it wasn't actually a problem. Now it seems yes it does actually matter
It's not a huge problem to change one right one to a left one, but I'll need to re-calibrate everything
Also I still wouldn't know if it was actually good that time, even if I put in that effort
It took me nearly an entire day to do it the first time
Basically the issue is I'm taking the right half of the shape on the top and the left half of the shape at bottom, but that actually ends up with the rhomb at the bottom right of the top shape is a right rhomb so I'll need to take the other one but it's totally disconnected from the rest of the shape so IDK if that's going to cause problems
@thejonymyster My latest idea was, rather than implementing something myself, to use actual regex lookarounds that get tested against the final generated string, and it rejects the string if the lookaround fails
One problem with that is Python regex flavor still doesn't have variable-length lookbehinds IIRC
@thejonymyster Basically there are 5 types of tiles, from top to bottom labeled A, B, C, D, and E. Then for each edge of each type of tile I need to store if you move in "north" or "east" for example, where will you end up? For example if you move north from B you end up on the east side of A. If you end up at the edge of the parent tile, repeat the process for the next tile up
Find the largest sum such that no two elements are touching
Inspired by this (off topic) post
Given an array of numbers, find the largest sum over a subset not containing two consecutive elements
[1,2,3,4] -> 6 // [_,2,_,4]
[1,2,3,4,5] -> 9 // [1,_,3,_,5]
[1,1,0,0,1,0,0,1] -> 3 ...
Calculate NDos-depth of given integer
Objective
Given a nonnegative integer, calculate its NDos-depth as defined below, and output it.
NDos' numeral system
The concept of NDos-depth comes from the numeral system I made. It represents every nonnegative integer by a nested list, as follows:
Given...
