Timeline for Hunt for discount
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2023 at 5:19 | history | edited | 138 Aspen | CC BY-SA 4.0 |
added 292 characters in body
|
| Apr 4, 2023 at 0:54 | history | edited | 138 Aspen | CC BY-SA 4.0 |
added 3 characters in body
|
| Apr 4, 2023 at 0:49 | history | edited | 138 Aspen | CC BY-SA 4.0 |
added 3 characters in body
|
| Apr 3, 2023 at 23:57 | comment | added | alephalpha |
30 bytes: a->-[0..#a-1]%2/2*vecsort(-a)~.
|
|
| Apr 3, 2023 at 23:53 | comment | added | alephalpha |
An answer should be a full program or a function. This is neither. You need to include f(a)= in your byte count, or write a lambda expression a->sum(i=0,(#a-2)\2,vecsort(a)[#a-1-2*i])/2.
|
|
| Apr 3, 2023 at 23:39 | history | edited | 138 Aspen | CC BY-SA 4.0 |
added 108 characters in body
|
| Apr 3, 2023 at 12:43 | history | answered | 138 Aspen | CC BY-SA 4.0 |