« first day (3124 days earlier)      last day (28 days later) » 

 
10 hours later…
1:59 PM
solving every challenge in Brainfuck, Seed or Malbolge from this site is the best way to get the most fun from it tbh
 
@KrzysztofSzewczyk Need to write a Malbolge generator in Brainfuck
 
2:35 PM
I've been working on the interpreter lately
yet it's not working because I'm a derp
and didn't fix the kinda obvious mistake in the code since a few hours
 
The absolute mad lad
 
while (re)joining the site when I came back from my hiatus
I discovered pretty weird thing about people taking cat in malbolge like it's something great
while well, there is some other stuff I'm doing that is (at least I hope) a bit richer
 
@NewMainPosts I doubt it's possible to write an answer in any "regular" language, such as C, C#, Java, F#, etc...
At least I wouldn't be aware on how to write a C# program without any key words, brackets, operators or any other "important" characters
I don't know any way to write any valid non-empty C# program, where you could randomly remove any character and it would still be valid.
Even something as simple as s=>"" would fail as soon as you would remove any one of these characters
 
3:21 PM
0
Q: Using **kwargs in Python

JitseI am not sure if this question has been asked before, but I was unable to find the answer. My question focuses primarily on Python, but it might be applicable to other languages too. Consider the following function which takes 5 arguments and prints them: def f(a,b,c,d,e): for i in a,b,c,d,e:p...

 
@NewMainPosts Canvas, 5 bytes, but not a valid answer as it takes an array of lines as input, and canvas just isn't able to take a (non-rectangular) multiline string as input
also i just realized it doesn't give the correct output for an empty input either :|
 
3:37 PM
@KrzysztofSzewczyk You should learn brain-flak. I enjoy it because it's usually a bit longer than brainfuck, but sometimes you can use some cool tricks that make it way shorter
Like with triangular/square numbers, or anything like summing over a range
 
3:55 PM
I'm not a big fan of brainflak
I heard about it but yeah, it doesn't kinda cut it for me
 
4:54 PM
0
Q: Identical grids(code-golf)

Kiara DanYou’re given two r*c grids. Each cell contains either 0 or 1. What are the minimum number of swaps are required in the first grid for it to match the second. If the matched arrangement can never be achieved output -1. Constraints 1 <= r <= 100 1 <= c <= 100 Examples input: 00 11 01 10 ...

 
5:08 PM
That's fine
 
5:33 PM
0
Q: How much code would a codegolf golf if a codegolf could golf code?

Greg MartinWrite a function or program that takes two words as input and outputs variants of the popular English tongue-twister "How much wood would a woodchuck chuck if a woodchuck could chuck wood?". The output will use the first word four times How much wood would a woodchuck chuck if a woodchuck coul...

 
5:53 PM
0
Q: Church Booleans

Ryan SchaeferChurch booleans A church boolean is a function that returns x for true and y for false where x is the first argument to the function and y is the second argument to the function. Further functions can be composed from these functions which represent the and not or and xor logical operations. Ch...

 
0
A: Sandbox for Proposed Challenges

QuinnFancy string replace Goal: Write a standard string replace function where the you replace all occurrences of a in a string S with b so long as a is not already an instance of b for example, if we have the string S = My oh my that there is a big ol' that and we wanted to do a fancy replace with...

 
6:14 PM
0
A: Sandbox for Proposed Challenges

caird coinheringaahingCan it be acronymised? The Typical Way to Make an Acronym Out of a Phrase Is to Take the First Letter of Each Word: TTWMAOPITFLEW. HoweveR, sometimEs, you can make an acronym of random leTters In a seNtence such As: RETINA. The only condition is that the letters have to be in the correct order. ...

 
 
2 hours later…
8:33 PM
0
A: Sandbox for Proposed Challenges

ShelvacuDistant Programs Create a program that, when run, prints "Do you still love me?" with or without a newline at the end. Your score is the Levenshtein distance to the closest non-erroring program (the non-erroring program doesn't have to do anything, although it might), and you want the largest s...

 

« first day (3124 days earlier)      last day (28 days later) »