Timeline for Find the largest banknote
Current License: CC BY-SA 4.0
63 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2023 at 12:35 | answer | added | lynn | timeline score: 1 | |
| Aug 18, 2023 at 21:56 | answer | added | fwoosh | timeline score: 0 | |
| Aug 18, 2023 at 10:41 | answer | added | The Thonnu | timeline score: 1 | |
| Oct 2, 2020 at 16:47 | answer | added | Wheat Wizard♦ | timeline score: 4 | |
| Sep 12, 2020 at 11:59 | answer | added | Wheat Wizard♦ | timeline score: 2 | |
| Sep 11, 2020 at 15:06 | answer | added | xash | timeline score: 1 | |
| Sep 11, 2020 at 12:00 | history | tweeted | twitter.com/StackCodeGolf/status/1304389249618382850 | ||
| Sep 9, 2020 at 14:19 | answer | added | Shaggy | timeline score: 3 | |
| Sep 9, 2020 at 14:12 | answer | added | 640KB | timeline score: 1 | |
| Sep 9, 2020 at 11:31 | answer | added | Jo King♦ | timeline score: 0 | |
| Sep 9, 2020 at 10:46 | answer | added | Ismael Miguel | timeline score: 0 | |
| Sep 8, 2020 at 18:26 | answer | added | Digital Trauma | timeline score: 2 | |
| Sep 8, 2020 at 13:27 | answer | added | Darren H | timeline score: 6 | |
| Sep 8, 2020 at 12:33 | comment | added | rydwolf | By the way, congrats on this challenge! You not only got it reopened, but got it made a HNQ! It was also pretty fun to make a solution for :D | |
| Sep 8, 2020 at 11:15 | answer | added | Abigail | timeline score: 0 | |
| Sep 8, 2020 at 10:56 | answer | added | Noodle9 | timeline score: 1 | |
| Sep 8, 2020 at 10:54 | answer | added | Zgarb | timeline score: 5 | |
| Sep 8, 2020 at 10:22 | answer | added | ZaMoC | timeline score: 2 | |
| Sep 8, 2020 at 9:00 | answer | added | Bubbler | timeline score: 4 | |
| Sep 8, 2020 at 8:28 | answer | added | SE - stop firing the good guys | timeline score: 0 | |
| Sep 8, 2020 at 8:14 | answer | added | Kevin Cruijssen | timeline score: 3 | |
| Sep 8, 2020 at 8:03 | comment | added | Tom Carpenter |
Can the input be taken as a string? Languages like Octave are very double heavy, so numbers like 999999999999999999 can't actually be represented properly - even just to write the last number, stupid things like uint64(999999999999999)*1000+999 have to be done.
|
|
| Sep 8, 2020 at 7:54 | answer | added | Tom Carpenter | timeline score: 1 | |
| Sep 8, 2020 at 7:19 | answer | added | Dorian | timeline score: 3 | |
| Sep 8, 2020 at 5:17 | history | edited | xnor | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Sep 8, 2020 at 5:17 | comment | added | xnor | @Bubbler I agree with this. Because the OP said in a comment that the sequence goes to 5e18, I put 1e19 as the upper bound for inputs. But when editing the challenge I didn't realize that it being above 2^63 would be in an issue in some languages, and the sequence may have only gone to 5e18 with this in mind. So I'll change the bound to 2^63, but I encourage the OP to consider loosening the bound to 2^32 or just let the defaults for number types handle it. | |
| Sep 8, 2020 at 1:59 | answer | added | Xcali | timeline score: 12 | |
| Sep 8, 2020 at 1:44 | answer | added | Razetime | timeline score: 1 | |
| Sep 8, 2020 at 1:32 | answer | added | Surculose Sputum | timeline score: 9 | |
| Sep 8, 2020 at 0:35 | comment | added | Bubbler |
The input will be less than 10^19 It looks like you're assuming the languages support 64-bit unsigned integers or higher, given that 2^63 < 10^19 < 2^64. It has the effect of unnecessarily penalizing languages that do not natively support such large integers. Note that, on this site, we usually allow solutions to use whatever native number type is available to the language of choice, as long as it does not fall into the category of abuse.
|
|
| Sep 8, 2020 at 0:14 | comment | added | caird coinheringaahin g♦ | @Shaggy Not fully sure if it answers your question, but the challenge says “the input will be less than \$10^{19}\$ | |
| Sep 7, 2020 at 23:51 | answer | added | Neil | timeline score: 5 | |
| Sep 7, 2020 at 23:40 | answer | added | Neil | timeline score: 3 | |
| Sep 7, 2020 at 23:38 | answer | added | Matthew Jensen | timeline score: 4 | |
| Sep 7, 2020 at 23:12 | comment | added | Shaggy | Must we handle arbitrarily large inputs or may we assume the input is within the bounds of what our language can naturally cope with? | |
| Sep 7, 2020 at 22:44 | answer | added | JayCe | timeline score: 6 | |
| Sep 7, 2020 at 22:30 | answer | added | Scott | timeline score: 4 | |
| Sep 7, 2020 at 22:23 | history | became hot network question | |||
| Sep 7, 2020 at 22:12 | answer | added | xash | timeline score: 7 | |
| Sep 7, 2020 at 22:10 | answer | added | Noodle9 | timeline score: 2 | |
| Sep 7, 2020 at 22:08 | answer | added | Shaggy | timeline score: 1 | |
| Sep 7, 2020 at 21:58 | answer | added | Jo King♦ | timeline score: 7 | |
| Sep 7, 2020 at 21:49 | answer | added | Shaggy | timeline score: 4 | |
| Sep 7, 2020 at 21:37 | answer | added | xnor | timeline score: 15 | |
| Sep 7, 2020 at 21:36 | history | reopened |
xnor Arnauld Noodle9 caird coinheringaahin g♦ Jo King♦ |
||
| Sep 7, 2020 at 21:25 | review | Reopen votes | |||
| Sep 7, 2020 at 21:40 | |||||
| Sep 7, 2020 at 21:11 | history | edited | xnor | CC BY-SA 4.0 |
added 58 characters in body
|
| Sep 7, 2020 at 21:06 | comment | added | xnor | I edited to clarify a bit based on the comments. Should be reopenable now. | |
| Sep 7, 2020 at 21:05 | history | edited | xnor | CC BY-SA 4.0 |
added 147 characters in body
|
| Sep 7, 2020 at 19:36 | comment | added | Xcali | @Arnauld Fair enough. I didn't look that closely. | |
| Sep 7, 2020 at 18:24 | comment | added | Xcali | @Arnauld Frankly, a challenge like this, from a new user, just sounds like someone is trying to get their homework done by the community here. I'd downvote it based on that. | |
| Sep 7, 2020 at 15:23 | comment | added | Arnauld | Suggested formula to describe the notes: \$m\times 10^n,\:m\in\{1,2,5\},\:n\ge 0\$ (see the Mathjax code for this). I don't think an upper limit on \$n\$ should be explicitly defined as the values that can be supported depend on the language anyway. | |
| Sep 7, 2020 at 15:20 | comment | added | stephanmg |
While I assume 5e18 should be the upper limit, it would be good to clarify.
|
|
| Sep 7, 2020 at 15:17 | comment | added | Shaggy |
@user, I voted to reject your edit as it's not clear from the comment alone whether the upper limit is 5e18 or, as you surmise, 5en.
|
|
| Sep 7, 2020 at 15:10 | answer | added | rydwolf | timeline score: 3 | |
| Sep 7, 2020 at 15:06 | history | closed |
ZaMoC Shaggy caird coinheringaahin g♦ Luis Mendo Noodle9 |
Needs details or clarity | |
| Sep 7, 2020 at 14:42 | review | Suggested edits | |||
| Sep 7, 2020 at 15:37 | |||||
| Sep 7, 2020 at 14:40 | review | Close votes | |||
| Sep 7, 2020 at 15:11 | |||||
| Sep 7, 2020 at 14:40 | comment | added | Shaggy |
In addition to @Razetime's comment, do we take it, then, that 2e18 is the maximum denomination?
|
|
| Sep 7, 2020 at 14:35 | comment | added | Razetime | If you are mentioning a rule in the comments, please add them to your question. It's a good practice that will welcome correct answers. | |
| Sep 7, 2020 at 14:30 | comment | added | Anthony Faull | The sequence can also be represented as 1e0, 2e0, 5e0, 1e1, 2e1, 5e1, 1e2, 2e2, 5e2,..., 1e18, 2e18, 5e18. | |
| Sep 7, 2020 at 14:22 | comment | added | Shaggy | You're going to need to give us the full list, without it it'll be pure guesswork on our part what "etc." represents. | |
| Sep 7, 2020 at 14:15 | history | asked | Anthony Faull | CC BY-SA 4.0 |