Normalized Malbolge to Malbolge translator
In this task, you will write a program/function that takes a Normalized Malbolge program and outputs the resulting Malbolge program. This is possible, because @MilkyWay90 had already done it before.
Input
A data structure that (somehow) represents a N...
Church 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 xor and implies logical operati...
The challenge
Given two strings, each of length up to 30, consisting of printable ASCII characters (codes \$[32, 126]\$), put them onto a balance scale in the fewest bytes of code! This consists of the following steps:
Calculate and compare the weights of the strings
Choose the appropriately t...
let S, a and b each represent a string
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 part of 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 ...
@Pavel that's because it's if condition; then ...; fi. [ ] just happens to be something that's useful in an if condition, but you could easily use it with && or || instead.
Anonymous
11:49 PM
@DJMcMayhem It has the same problem as C/C++ imo - too much stuff was added as an afterthought, and the syntax and function has never undergone an overhaul
Normalized Malbolge to Malbolge translator
In this task, you will write a program/function that takes a Normalized Malbolge program and outputs the resulting Malbolge program. This is possible, because @MilkyWay90 had already done it before.
Input
A data structure that (somehow) represents a N...
The challenge
Given two strings, each of length up to 30, consisting of printable ASCII characters (codes \$[32, 126]\$), put them onto a balance scale in the fewest bytes of code! This consists of the following steps:
Calculate and compare the weights of the strings
Choose the appropriately t...
hi what is this code and how can i write it or translate it?
java.lang.Boolean##0V@AQID3JJUH895KTBDztW/TPOZEic/4w/AhA6suZnt4BEgrKc=
let S, a and b each represent a string
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 part of 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 ...
