Timeline for Factor-poor numbers
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 3, 2018 at 14:52 | history | edited | Daniel | CC BY-SA 3.0 |
deleted 76 characters in body
|
| Jan 3, 2018 at 14:47 | comment | added | Mr. Xcoder | Precisely. Now you can reuse without assigning it separately. | |
| Jan 3, 2018 at 14:37 | comment | added | Daniel |
@Mr.Xcoder, ah so Kl{PT both assigns l{PT to K and returns the newly assigned K?
|
|
| Jan 3, 2018 at 14:32 | comment | added | Mr. Xcoder |
Nope. h is +1, t is -1, while K is a variable which gets assigned without =. For example, K4 assigns K to 4. You can then access it using K.
|
|
| Jan 3, 2018 at 14:29 | comment | added | Mr. Xcoder | 25 bytes using your approach. | |
| Jan 3, 2018 at 14:28 | history | edited | Daniel | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jan 3, 2018 at 14:20 | comment | added | Mr. Xcoder | @Dopapp Ok then, I posted it separately. +1 Welcome to Pyth golfing! | |
| Jan 3, 2018 at 14:18 | comment | added | Daniel | @Mr.Xcoder, wow I don't think I would have gotten that anytime soon! Wouldn't you say it merits its own answer? | |
| Jan 3, 2018 at 14:12 | comment | added | Mr. Xcoder |
14 bytes: .f!-.ml{Pb}tZh (prints the first n) (.f retrieves the first n values that satisfy a condition over [1,2,3,...] and uses a variable Z, }tZh generates the integer range [Z - 1 ... Z + 1], .m return the list of elements with minimal function value (with b), l{Pb gets the count of distinct divisors, - discards Z from the list, ! applies logical negation)
|
|
| Jan 3, 2018 at 14:12 | history | edited | Daniel | CC BY-SA 3.0 |
deleted 389 characters in body
|
| Jan 3, 2018 at 14:09 | history | answered | Daniel | CC BY-SA 3.0 |