Timeline for The Coin Problem
Current License: CC BY-SA 3.0
Post Revisions
27 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2022 at 15:31 | history | edited | pxeger |
edited tags
|
|
| Jan 11, 2020 at 22:58 | answer | added | Simply Beautiful Art | timeline score: 0 | |
| Oct 22, 2019 at 5:20 | comment | added | Xi'an ні війні | A tighter upper bound is \$\min(n_i-1)(n_j-1)\$, minimised over all pairs of coprime elements of the sequence. | |
| Oct 21, 2019 at 13:37 | answer | added | Xi'an ні війні | timeline score: 3 | |
| May 23, 2017 at 12:41 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Oct 5, 2015 at 19:18 | vote | accept | Zgarb | ||
| Sep 7, 2015 at 12:25 | answer | added | PurkkaKoodari | timeline score: 4 | |
| Sep 7, 2015 at 11:52 | comment | added | izzyg |
I have a 13 byte Pyth solution that can do [2,3] in a reasonable amount of time and nothing else. [2,5] would create about a million Python lists in memory.
|
|
| Sep 7, 2015 at 1:19 | history | edited | Zgarb | CC BY-SA 3.0 |
Added note about the duplicate.
|
| Sep 7, 2015 at 0:25 | comment | added | Zgarb | @Qwertiy Thanks, added. | |
| Sep 7, 2015 at 0:24 | history | edited | Zgarb | CC BY-SA 3.0 |
added 22 characters in body
|
| Sep 6, 2015 at 22:15 | comment | added | Qwertiy |
Please add a test case [2, 51, 6] -> 49 to force numeric sorting instead of the text one. See my solution (1st and 2nd revisions) for more details.
|
|
| Sep 6, 2015 at 22:01 | answer | added | Qwertiy | timeline score: 1 | |
| Sep 6, 2015 at 20:32 | answer | added | Jarmex | timeline score: 9 | |
| Sep 6, 2015 at 20:11 | comment | added | Zgarb | @vihan Good find. This may count as a duplicate question then. | |
| Sep 6, 2015 at 19:58 | comment | added | Zgarb | @Dennis No hard limits, I just edited that in. | |
| Sep 6, 2015 at 19:57 | comment | added | Zgarb | @orlp Thanks. That'll teach me to actually read a paper before citing it... | |
| Sep 6, 2015 at 19:57 | history | edited | Zgarb | CC BY-SA 3.0 |
added 167 characters in body
|
| Sep 6, 2015 at 17:46 | answer | added | orlp | timeline score: 2 | |
| Sep 6, 2015 at 17:39 | comment | added | Downgoat | On Stack Overflow there was a code golf question like this a while back | |
| Sep 6, 2015 at 17:32 | history | tweeted | twitter.com/#!/StackCodeGolf/status/640578331180703744 | ||
| Sep 6, 2015 at 17:01 | comment | added | Dennis | Are there any limits of run time or memory usage? | |
| Sep 6, 2015 at 16:58 | comment | added | orlp |
There is a way better upper bound, found in this paper that establishes (p - 1)(q - 1) as the upper bound, where p and q are the smallest and biggest element of the set.
|
|
| Sep 6, 2015 at 16:32 | comment | added | Zgarb | @alephalpha Good catch, I had forgotten to disallow built-ins. | |
| Sep 6, 2015 at 16:32 | history | edited | Zgarb | CC BY-SA 3.0 |
Disallowed built-ins.
|
| Sep 6, 2015 at 16:30 | comment | added | alephalpha |
FrobeniusNumber in Mathematica.
|
|
| Sep 6, 2015 at 16:17 | history | asked | Zgarb | CC BY-SA 3.0 |