Timeline for Shifted auto-sum
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2022 at 2:26 | comment | added | tsh | @alephalpha nice idea. and I got a 28 bytes recursive, still longer than the string replace. | |
| Jul 27, 2022 at 2:25 | history | edited | tsh | CC BY-SA 4.0 |
added 42 characters in body
|
| Jul 26, 2022 at 11:03 | comment | added | alephalpha |
@tsh 30 bytes recursive: n=>(g=i=>i&&n+10*g(i/10|0))(n).
|
|
| Jul 26, 2022 at 9:21 | comment | added | tsh |
@emanresuA Best recursive function I can get is 33 bytes. Even worse than the Math.log10 ones. n=>(g=i=>i+n<[n]+n&&i+g(i*10))(n)
|
|
| Jul 26, 2022 at 9:09 | comment | added | emanresu A | I suspect there might be a clever recursive solution... | |
| Jul 26, 2022 at 8:59 | history | edited | tsh | CC BY-SA 4.0 |
deleted 31 characters in body
|
| Jul 26, 2022 at 8:54 | history | answered | tsh | CC BY-SA 4.0 |