Timeline for Finding the power sandwich version 2
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2023 at 7:05 | history | edited | bsoelch | CC BY-SA 4.0 | update test cases |
| Oct 30, 2023 at 6:59 | history | edited | bsoelch | CC BY-SA 4.0 | capitalisation |
| Oct 30, 2023 at 6:33 | history | edited | bsoelch | CC BY-SA 4.0 | -2 bytes |
| Oct 29, 2023 at 21:00 | comment | added | corvus_192 | You can iterate range(2,n+1), which is very slow, but technically correct. Need the extra int() to prevent float overflow problems. Results in 105 bytes lambda n:[R:=range(2,n+1),max(int(n**(1/p))**p for p in R),min(int(abs(n**(1/p)//-1))**p for p in R)][1:] | |
| Oct 29, 2023 at 13:24 | history | edited | bsoelch | CC BY-SA 4.0 | add shorter solution |
| Oct 29, 2023 at 9:03 | history | edited | bsoelch | CC BY-SA 4.0 | -9 bytes |
| Oct 29, 2023 at 8:45 | history | edited | bsoelch | CC BY-SA 4.0 | -4 bytes |
| Oct 29, 2023 at 8:36 | history | edited | bsoelch | CC BY-SA 4.0 | -5 bytes |
| Oct 29, 2023 at 8:22 | history | edited | bsoelch | CC BY-SA 4.0 | deleted 1 character in body |
| Oct 29, 2023 at 8:16 | history | edited | bsoelch | CC BY-SA 4.0 | fix case n=2 |
| Oct 29, 2023 at 8:11 | history | answered | bsoelch | CC BY-SA 4.0 |