Timeline for What's the shortest contiguous subset of ASCII you need to output the rest?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2014 at 3:20 | comment | added | Pharap | "Can probably be parsed as Morse code with the right spaces." Coincidentally I have a program that I wrote in C# that reads text and beeps it back as morse code. Internally it converts the characters into - and ., so with a bit of modification it could probably be done. | |
| Aug 8, 2014 at 15:18 | comment | added | Amory | +1 "Can probably be parsed as Morse code with the right spaces." | |
| Aug 6, 2014 at 9:48 | comment | added | Lou |
Oh sorry, when I scrolled along I thought it was just a string of - with just one . at the end :). My bad.
|
|
| Aug 6, 2014 at 9:25 | comment | added | Level River St |
@LeoKing you need to be more observant. there are 256-126=130 -, then the descending part .-.-.etc then the ascending part (groups of 255 - followed by a .) As far as I can tell it's all there. Also see edit on my answer for explanation.
|
|
| Aug 6, 2014 at 8:59 | comment | added | Lou | How does this work? There's only one output at the end, I don't understand how it can output the whole 95 character string. | |
| Aug 6, 2014 at 5:45 | comment | added | Level River St | Very good. This occured to me after I went to bed :-D | |
| Aug 6, 2014 at 3:01 | history | edited | nneonneo | CC BY-SA 3.0 |
added 21 characters in body
|
| Aug 6, 2014 at 2:53 | history | answered | nneonneo | CC BY-SA 3.0 |