Timeline for Convert prefix to infix
Current License: CC BY-SA 4.0
40 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2022 at 14:12 | answer | added | bigyihsuan | timeline score: 3 | |
| Apr 6, 2022 at 4:04 | answer | added | alephalpha | timeline score: 3 | |
| Feb 26, 2022 at 13:26 | answer | added | zoomlogo | timeline score: 2 | |
| S Dec 4, 2021 at 21:26 | history | bounty ended | tjjfvi | ||
| S Dec 4, 2021 at 21:26 | history | notice removed | tjjfvi | ||
| Nov 30, 2021 at 9:59 | comment | added | emanresu A | @Radek Ignore my previous comment, I checked the meta post you found, and it looks fine, so sure! | |
| Nov 30, 2021 at 9:57 | comment | added | emanresu A | @Radek I'm not sure about that - maybe consult the input/output standards (Or post one if what you want's not there) or ask in The Nineteenth Byte. | |
| Nov 29, 2021 at 14:47 | comment | added | Radek |
A question related to my answer. Can the solution be a Haskell's computation a :: IO (), which reads the stdin and outputs to stdout, but not a full Haskell program (that is, missing the line main = a)? This saves a few bytes, yet it is not a function. Type IO a for results of type a was explicitly allowed here.
|
|
| Nov 29, 2021 at 14:41 | answer | added | Radek | timeline score: 2 | |
| S Nov 28, 2021 at 20:29 | history | bounty started | tjjfvi | ||
| S Nov 28, 2021 at 20:29 | history | notice added | tjjfvi | Reward existing answer | |
| Nov 28, 2021 at 20:02 | answer | added | user | timeline score: 7 | |
| Nov 28, 2021 at 2:28 | answer | added | cg909 | timeline score: 3 | |
| Nov 27, 2021 at 17:13 | answer | added | Wasif | timeline score: 1 | |
| Nov 26, 2021 at 20:03 | answer | added | user | timeline score: 2 | |
| Nov 25, 2021 at 12:58 | answer | added | frasiyav | timeline score: 1 | |
| Nov 25, 2021 at 7:06 | comment | added | xigoi | @PauloEbermann That would be with normal operators. | |
| Nov 25, 2021 at 0:08 | answer | added | att | timeline score: 2 | |
| Nov 24, 2021 at 23:32 | comment | added | Paŭlo Ebermann | @xigoi how is the precedence defined for letters? | |
| Nov 24, 2021 at 21:31 | answer | added | 640KB | timeline score: 6 | |
| Nov 24, 2021 at 20:16 | answer | added | recursive | timeline score: 1 | |
| Nov 24, 2021 at 17:59 | answer | added | Adnan | timeline score: 4 | |
| Nov 24, 2021 at 17:03 | answer | added | DLosc | timeline score: 1 | |
| Nov 24, 2021 at 10:48 | answer | added | Olivier Grégoire | timeline score: 2 | |
| Nov 24, 2021 at 5:46 | answer | added | att | timeline score: 2 | |
| Nov 23, 2021 at 23:12 | answer | added | lonelyelk | timeline score: 3 | |
| Nov 23, 2021 at 21:43 | comment | added | xigoi | Bonus challenge: Remove all parentheses that are redundant in the conventional infix notation. | |
| Nov 23, 2021 at 21:00 | answer | added | Kjetil S | timeline score: 3 | |
| Nov 23, 2021 at 19:47 | history | edited | emanresu A | CC BY-SA 4.0 |
added 77 characters in body
|
| Nov 23, 2021 at 19:46 | comment | added | emanresu A | @pajonk Sure, that's fine. | |
| Nov 23, 2021 at 19:11 | answer | added | Neil | timeline score: 1 | |
| Nov 23, 2021 at 17:03 | history | became hot network question | |||
| Nov 23, 2021 at 16:53 | comment | added | pajonk | May we I/O as vector/array of characters or of ASCII char codes? | |
| Nov 23, 2021 at 13:36 | answer | added | pajonk | timeline score: 4 | |
| Nov 23, 2021 at 12:00 | history | tweeted | twitter.com/StackCodeGolf/status/1463115115197308931 | ||
| Nov 23, 2021 at 11:49 | answer | added | tsh | timeline score: 6 | |
| Nov 23, 2021 at 11:38 | answer | added | alephalpha | timeline score: 4 | |
| Nov 23, 2021 at 10:41 | answer | added | loopy walt | timeline score: 9 | |
| Nov 23, 2021 at 9:22 | answer | added | Neil | timeline score: 3 | |
| Nov 23, 2021 at 9:02 | history | asked | emanresu A | CC BY-SA 4.0 |