Timeline for Calculate the difficulty of a Code Golf question
Current License: CC BY-SA 3.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 17, 2016 at 15:37 | comment | added | Rod |
@KarlNapf beucase ~-v/a/70+1 may generate a number higher than 10 (last test for example)
|
|
Aug 17, 2016 at 15:20 | comment | added | Karl Napf |
Why *10 then substring? Multiply with the right amount straight away: lambda v,a:('*'*(~-v/a/70+1))
|
|
Aug 17, 2016 at 15:12 | history | edited | mathause | CC BY-SA 3.0 |
edited body
|
Aug 17, 2016 at 14:01 | history | edited | mathause | CC BY-SA 3.0 |
added 2 characters in body
|
Aug 17, 2016 at 14:00 | comment | added | Leaky Nun |
~ is bitwise negation, which turns n to -(n+1) . (here for more info)
|
|
Aug 17, 2016 at 14:00 | comment | added | mathause | thanks - no idea how that works | |
Aug 17, 2016 at 13:59 | history | edited | mathause | CC BY-SA 3.0 |
added 2 characters in body
|
Aug 17, 2016 at 13:52 | comment | added | Leaky Nun |
Instead of using (v-1) , you can use ~-v .
|
|
Aug 17, 2016 at 13:51 | comment | added | Leaky Nun | That would not be wrong for v=0, a=1. | |
Aug 17, 2016 at 13:50 | comment | added | mathause | thanks! should work now. May be wrong for v=0, a=1 now, but this case cannot exist, can it? | |
Aug 17, 2016 at 13:48 | history | edited | mathause | CC BY-SA 3.0 |
added 68 characters in body
|
Aug 17, 2016 at 13:27 | comment | added | Leaky Nun |
v, a can become v,a
|
|
Aug 17, 2016 at 13:27 | comment | added | Leaky Nun |
The f= can be removed
|
|
Aug 17, 2016 at 13:26 | comment | added | Leaky Nun |
fails when v=70 and a=1
|
|
Aug 17, 2016 at 13:26 | history | answered | mathause | CC BY-SA 3.0 |