Timeline for Sum square difference
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2021 at 16:43 | comment | added | S.S. Anne | 34 bytes Try it online! | |
| Nov 11, 2018 at 13:16 | history | edited | HatsuPointerKun | CC BY-SA 4.0 |
added 9 characters in body
|
| Nov 11, 2018 at 1:16 | history | edited | HatsuPointerKun | CC BY-SA 4.0 |
added 8 characters in body
|
| Nov 10, 2018 at 21:39 | comment | added | Adalynn | Ugh, always forget about that. | |
| Nov 10, 2018 at 21:38 | comment | added | HatsuPointerKun | @Zacharý No, it gives me bad results sometimes like 24 instead of 22 for input "3", or 85200 instead of 85100 for input "24". I suspect integer division to be the cause of that | |
| Nov 10, 2018 at 19:41 | comment | added | Adalynn |
It's possible to rearrange return p*p/4-p*(n-~n)/6 to return(p/4-(n-~n)/6)*p.
|
|
| Nov 10, 2018 at 19:26 | history | edited | HatsuPointerKun | CC BY-SA 4.0 |
added 4 characters in body
|
| Nov 10, 2018 at 16:06 | history | edited | HatsuPointerKun | CC BY-SA 4.0 |
added 31 characters in body
|
| Nov 7, 2018 at 7:55 | history | edited | HatsuPointerKun | CC BY-SA 4.0 |
added 28 characters in body
|
| Nov 6, 2018 at 14:09 | comment | added | Adalynn |
You could fix up the problem with the macros at the cost of A LOT of bytes by replacing all the n with (n). Also, F(n) n=>F(n)n regardless.
|
|
| Nov 5, 2018 at 19:55 | history | answered | HatsuPointerKun | CC BY-SA 4.0 |