Timeline for Find a multiple of a given number whose decimal representation looks like binary
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot | replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/ | |
| Oct 18, 2015 at 9:03 | history | edited | primo | CC BY-SA 3.0 | added 474 characters in body |
| Oct 18, 2015 at 7:46 | comment | added | primo | @skmrn That's brilliant. I had tried oct'0b'.++$\*$_, but it silently trims invalid digits. I didn't think to use eval instead. | |
| Oct 17, 2015 at 23:31 | comment | added | svsd | But I guess we'll need to include use bigint to support the large numbers that OP has mandated to be supported :( | |
| Oct 17, 2015 at 23:11 | comment | added | svsd | Nice :) I learnt a couple of new things from your post today! While reading through your code, I found a way to shave off a couple of bytes from the first code: eval"0b".$_*++$\||redo}{ | |
| Oct 17, 2015 at 5:29 | history | edited | primo | CC BY-SA 3.0 | added 388 characters in body |
| Oct 16, 2015 at 5:49 | history | answered | primo | CC BY-SA 3.0 |