The Nineteenth Byte

« first day (1076 days earlier) ← previous day next day → last day (4062 days later) »

ardnew

01:55

im in a pickle for selecting the winner of the f(f(n)) = -n golf challenge

i definitely agree that the originally accepted answer (codegolf.stackexchange.com/a/11972/3348) doesn't adhere to spec

however, i don't know how to verify that the shortest answer (codegolf.stackexchange.com/a/11970/3348) is complete and correct

ive already accepted it as the answer based entirely on the fact nobody has raised a valid objection

can i accept an answer i can't read or know how to validate?

user2509848

02:12

Download J?

jsoftware.com/stable.htm

ardnew

02:24

if i were only verifying the output for each input i try, then i would not have disqualified that mathematica answer (or any of the answers using a complex codomain)

i need some rudimentary understanding of the language syntax to verify its adhering to spec

otherwise, im also very comfortable accepting the answer based only on recommendation of some of the other golf wizards here that do understand that J solution

2 hours later…

user2509848

04:42

Anyone want to try this?

Q: Morse code to standard output

This question involves taking input in Morse code as . (period) and - (minus symbol), with spaces to separate the input. Your task is to convert the code to standard output. You can assume that the only input contains character symbols found in the International Morse Code alphabet, found here:...

code-golf

Two views 30 minutes later...

4 hours later…

Gareth

08:56

@ardnew That J code is a direct translation of the code given in the answer he links: f(n) = sign(n) - (-1)n * n. It executes from right to left, so first it will calculate -1 to the power of n (_1&^), then it will multiply that by n ([*) then take that from sign(n) (*-). So if the formula given meets your spec you can be happy accepting that answer.

11 hours later…

user2509848

20:18

9.8 questions per day!

1078