Timeline for Calculate the points in a "sjoelen"-game
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2015 at 15:12 | comment | added | lirtosiast |
When ported into TI-BASIC, it's 15 bytes: sum({2,3,4,1}(Ans+min(Ans
|
|
| Dec 27, 2014 at 18:02 | comment | added | kukac67 | @swish Well, thanks for all the help, but you should have just posted your own answer. :D | |
| Dec 27, 2014 at 18:02 | history | edited | kukac67 | CC BY-SA 3.0 |
wow!
|
| Dec 27, 2014 at 17:54 | comment | added | swish |
Actually you can do dot product here (# + Min@#).{2, 3, 4, 1}&
|
|
| Dec 27, 2014 at 16:34 | history | edited | kukac67 | CC BY-SA 3.0 |
added 63 characters in body
|
| Dec 27, 2014 at 16:32 | comment | added | kukac67 | @swish Oh! That's even better. But I can't wrap my head around why that works? | |
| Dec 27, 2014 at 16:24 | comment | added | swish |
That's the whole function. You don't need to add 20*Min@#, you can get rid of it by replacing minus with plus, because conveniently 2+3+4+1==10.
|
|
| Dec 27, 2014 at 16:21 | history | edited | kukac67 | CC BY-SA 3.0 |
byte count
|
| Dec 27, 2014 at 16:18 | comment | added | kukac67 | @swish So clever! | |
| Dec 27, 2014 at 16:14 | comment | added | swish |
Tr[(# + Min@#) {2, 3, 4, 1}] &
|
|
| Dec 27, 2014 at 15:38 | history | edited | kukac67 | CC BY-SA 3.0 |
typo
|
| Dec 27, 2014 at 12:40 | history | answered | kukac67 | CC BY-SA 3.0 |