In chat, starred messages appear in the panel to the right but are truncated to a certain length. Rather than have to follow the link to a new page, it would be useful to be able to hover over a starred message and see the full text.
Would there be demand for this?
Would this be practical to im...
StickStack Numbers
code-challenge numbers
StickStack is a very simple stack-based programming language with only two instructions:
| pushes the length of the stack onto the stack
- pops the top two elements of the stack and pushes back their difference (second topmost - topmost)
Language de...
Digits Digging the Deepest Dungon
code-golf numbers
Given a 9 element list, the counts of the one-digit positive integers, you should determine how deep dungeon can they dig.
The input will describe how many 1's, 2's, ... 9's will be available for the work. E.g. [5,2,0,0,0,0,0,0,3] means the a...
If I was wrong, I'd say to. But I was right, so I'll just go ahead and assume everyone else is on my level of understanding or higher. That's normally a pretty safe assumption ;)
@randomra the digging dungeons challenge could be clearer if you mentioned first that digits need to be able to get in and out of the dungeon.
do you have a test case where the greedy approach fails? (use numbers from lowest to highest and always dig in the deepest possible position while keeping the depths sorted?)
Not trivial, intuitively seems true, and I thought quite some time about it (and that seemed to support the case) but don't have a proper proof.
In the other challenge is "Your primary score is the total length of the StickStack programs for the below given test cases. (Your submission is only valid if you ran your program on all the test cases and counted your score.)" unambiguous? I (and other) had many problem with these kind of scorings.
Every digit can remove exactly one block of soil from below itself but it has to reach that position from outside the dungeon and after it removed the block has to leave the dungeon. While doing so a digit **can't descend or ascend more than its numerical value** at any horizontal step.
Finding pairs for letters
code-golf simulation? ascii-art?? (do we use ascii-art for input?)
You should write a program or function which given a string as input outputs or returns a string or list of the lowercase letters in the order they find their uppercase pair.
The input is a string cons...
I've got an idea for a challenge...but I just want to get some thoughts on it!
Input: An image which is not centralised (eg, the union jack in the top left of a png). excluding the object (union jack) the whole canvas is blank (white or transparent).
@Optimizer That sounds more involved, but also interesting. Would the pixel weight be 0 for white, 1 for non-white, or would the pixel weight increase for gradually darker colours?
I mean the way the image is stored (input and output). Sorry encoding was the wrong word
Some people specify a format (eg. pbm). Other people say "You can choose the format that suits your language best"
Posting in the sandbox is the best way to get feedback, as you only get feedback from the people who happen to be in the room in chat, whereas leaving it in the sandbox for a week means more people see it
is there no way in Pyth to convert a float to int ?
where is orlp now who is always boasting that Pyth is better than CJam ?
(^ link not visible to low rep users)
@Joshpbarron you should also change your code into a function/program. right now, it assumes input in x but its not much of a difference to convert it to an anonymous function
People will always find loopholes around atomic code golf. Banning strings? Okay, I'll use comments and read my own file. Banning reading own file? Okay, long variable names. Banning unreasonably long variable names? Well I have this 2000-digit integer which encodes what I need...
@MartinBüttner btw picked a new sequence for Fission yet?
I wonder if something like a reverse atomic code golf could be fun: you get to define a fixed number of operators (or functions) on numbers - say 2 unary, 4 binary, 1 ternary. and a series of arithmetic tasks (more than than there are operators). and you may only use these self-defined operators to solve them. score is then either plain code golf or number of times you've used the operators across all tasks.
(the definition of the operators would be free in either case)
so it would be something like this except you get to choose what your operators do.
You call it alignment, I call it Code-Golf.
Doesn't it annoy you when images aren't correctly aligned?
Rules:
1) You are to generate a program.
2) Standard Loopholes are a nono.
3) Input will be a file, however whether it is passed as a file or a list of numbers is up to you.
4) Output will...
You call it alignment, I call it Code-Golf.
Doesn't it annoy you when images aren't correctly aligned?
Rules:
1) You are to generate a program.
2) Standard Loopholes are a nono.
3) Input will be a file, however whether it is passed as a file or a list of numbers is up to you.
4) Output will...
Also, people react more positively to positive statements. You might try: Before: Doesn't it annoy you when images aren't correctly aligned? After: Do you enjoy basking in the glory of images that are correctly aligned?
2
On a more serious note: Are your input images guaranteed to be symmetrical?
@Joshpbarron Standard loopholes are disallowed by default. Anyone abusing them will be downvoted into oblivion if you point it out in a comment. Sometimes they get straight up deleted as Not an Answer. So you don't have to ban them in your challenge if, like me, you like to keep it short.
Is this a duplicate? Reorder tuples with minimal number of deletions so there would be an increasing sequence in every element position e.g. (1,2,3),(2,3,2),(5,4,3) => (2,3,2),(5,4,3) with 1 deletion
@randomra "These are useful because both "?" and "*" don't touch the 3 commands already in the bit tree, so if you need nothing to happen then using those no-ops are good." I've been re-reading that sentence so often and trying to make sense of it... could it be that commands only fall one level per tick and are pipelined like that? (as opposed to falling all the way through before reading the next command)
every jump needs a ton of plus work before and after and all is relative so subject to change and jump is the only way to do anything as you have only the (0 1 not) functions and you work one bit at a time