Timeline for Is it a vampire number?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2021 at 8:08 | comment | added | Dominic van Essen |
Edit 3 (only check %10 for one factor, since each pair will always occur both ways around) is really smart! I've copied the approach to save a byte in my Husk answer - Thanks!
|
|
| Feb 11, 2021 at 7:16 | history | edited | pajonk | CC BY-SA 4.0 |
It is sufficient to only check one of i and n/i whether is not divisible by 10
|
| Feb 9, 2021 at 13:02 | history | edited | pajonk | CC BY-SA 4.0 |
j<-n/i
|
| Feb 9, 2021 at 12:01 | history | edited | pajonk | CC BY-SA 4.0 |
added 107 characters in body
|
| Feb 9, 2021 at 11:55 | comment | added | Dominic van Essen |
Really nice! And you can drop the 2xsort by using %in% for 146 bytes...
|
|
| Feb 9, 2021 at 10:02 | history | answered | pajonk | CC BY-SA 4.0 |