Timeline for In Honor of Adam West
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| S Jun 16, 2017 at 9:58 | history | suggested | PM 2Ring | CC BY-SA 3.0 |
Implemented changes mentioned in the comments
|
| Jun 16, 2017 at 9:33 | comment | added | L3viathan | @PM2Ring in a bus already, so I'll just hope someone else will approve it | |
| Jun 16, 2017 at 9:30 | review | Suggested edits | |||
| S Jun 16, 2017 at 9:58 | |||||
| Jun 16, 2017 at 9:27 | comment | added | PM 2Ring | Oh, ok. But I'll let you do the new un-golfed version. | |
| Jun 16, 2017 at 9:26 | comment | added | L3viathan | @PM2Ring I don't mind at all. Going on vacation for a few weeks so feel free to edit in your changes. | |
| Jun 16, 2017 at 9:24 | comment | added | PM 2Ring |
That encoding method's better than base 36. I hope you don't mind that I've adapted it for my latest solution. ;) There are a few things you can do to reduce your byte count. 1 You can save a byte by putting the print call on the same line as the for. 2 If you use a bytes string you can get rid of those ord calls. 3 You can replace the range by zipping over a pair of iterators. Here's a generator that combines both those ideas: ((u-35)*" "+(v-35)*"*"for u,v in zip(*[iter(s)]*2)). Those changes will bring your count down to 164.
|
|
| Jun 15, 2017 at 12:04 | history | edited | L3viathan | CC BY-SA 3.0 |
added 649 characters in body
|
| Jun 15, 2017 at 11:42 | history | edited | L3viathan | CC BY-SA 3.0 |
deleted 610 characters in body
|
| Jun 15, 2017 at 11:29 | history | edited | L3viathan | CC BY-SA 3.0 |
deleted 34 characters in body
|
| Jun 15, 2017 at 11:24 | history | edited | L3viathan | CC BY-SA 3.0 |
deleted 34 characters in body
|
| Jun 15, 2017 at 10:45 | history | answered | L3viathan | CC BY-SA 3.0 |