@RedwolfPrograms I've had a couple of proposals in the Sandbox for a similar idea before, but the main problem is finding a task that works for both CnR and answer chaining
Also, if it has to be a single byte shorter, then the first answer determines the max number of answers and if it's any number of bytes shorter, all it takes is for an answer to be simple enough for a 1-byte solution and the challenge dies
Yeah, the problem is finding a good enough "somehow" to make the challenge a combo of the two, rather than just an answer-chaining with some CnR or the other way around
You know those riddles where every letter is swapped for another letter?
E.g. you get a text like
JME JG EPP IFAPE EPJE CJPPPC BP,
UIJCG JC EPP EFE GPJB EJIP EJ EJIP,
F EPJIG MPJEPPPP AJUC BJL UP
GJP BL MICJIJMPPJUIP CJMI.
and are supposed to find out that it stands for
OUT OF THE NI...
You get a string representation of a chessboard. It consists of 64 characters going row wise from top left to bottom right.
The figures are denoted with: K king Q queen R rook, castle B bishop N knight P pawn for white, and lowercase k q r b n p for black. Space means empty.
The starting would be...
I should probably work more on my website, I haven't changed it since like a year ago when I tried to make it look "educational" so my school would unblock it
I had no idea anyone played my games, until one of my friends commented about how he'd see people playing Merchant in class. It was kind of sad when my school blocked it :/
there's this bloke on discord, he got an assignment to cause a floating point error, by assigning something to a and b, so that (a + b) * 10 and a * 10 + b * 10 are 20% off
Your task is to write a program that, on input n, outputs the minimal expression of each number 1 through n in order. The shortest program in bytes wins.
A minimal expression combines 1's with addition and multiplication to result in the given number, using as few 1's as possible. For example, ...
Is it a Pythagorean triple? code-golf decision-problem geometry math number-theory
Given three numbers, determine whether they form a primitive Pythagorean triple. Here is the definition:
all three numbers are positive integers
they represent the side lengths of a right-angled triangle, that is,...
@cairdcoinheringaahing It would help I think if you put a slightly more programming sort of definition of the problem. I think I understand it, but since I'm only in a high school math class it would help if there was more of a code-like explanation of the task (like "take some positive integers as input, and return a provably unique positive integer for each possible input, making sure each possible output can be obtained given some input").
Other than that, I think it's a good challenge, and I'll be really interested to see the results. (I'd actually been thinking of something similar not too long ago, but involving rational numbers).
@RedwolfPrograms Python probably beats Pyth on challenges which require an obscure module, beyond that, I'd doubt it, simply because of the $...$ feature that both have to run arbitrary Javascript/Python code
Imagine you place a knight chess piece on a phone dial pad. This chess piece moves from keys to keys in an uppercase "L" shape: two steps horizontally followed by one vertically, or one step horizontally then two vertically:
+-+
|1| 2 3
+-+
`-------v
| +-+
4 | 5 |6|
...
Imagine you place a knight chess piece on a phone dial pad. This chess piece moves from keys to keys in an uppercase "L" shape: two steps horizontally followed by one vertically, or one step horizontally then two vertically:
+-+
|1| 2 3
+-+
`-------v
| +-+
4 | 5 |6|
...
