delete + retag + undelete apparently doesn't bump, but idk if it sends a notification to the user and if it actually avoids the bump. i tested on my sock's answer and it still bumped it (but didn't send a notification). anyone have a question they'd be willing to help me test on?
TBF tho, you can't edit deleted questions (aside from tags), so unless you just silently undelete a post without editing it, its unlikely to be noticed
I have a bit of an odd idea: A script that lets you use your remaining votes at the end of the day to vote for specific answers nominated by other people. When you do that, you get a fraction of a nomination for each vote you cast. So if you notice an answer you like, you can nominate it and it'd get lots more votes. Users would still select which nominated posts their votes go toward, so it wouldn't just be voting fraud with extra steps. Opinions? (Won't actually do it but it's a cool concept)
I think that sounds interesting, maybe a similar thing could be to have an answer/answers of the day/week? Highlight potentially overlooked answers to questions that are notable
I mean you basically get the equivalent of a free +400 bounty per day to divide up as you please, but there's no easy way to quickly determine which posts are impressive enough to deserve it
TBH, sounds like an abuse of the SE system again, but I could get behind this :P if distributed voting like this is agreed on by the community and not disallowed by TOS (don't think it should be, since you're just making a decision on how to use your legitimate votes) this could be fine
I think automating it so that the user just hands control over to the script would definitely be questionable, but a system that just shows you posts people nominate (with some other features) doesn't seem at all bad
A better alternative would be to allow users to nominate posts that they believe deserve votes (e.g. on a meta question) and people who want to spend their remaining votes can visit that and take a look
Having to track down the post, scroll past ones you've already seen, etc. takes a non-trivial amount of time, and is enough of a barrier to be discouraging
Being able to just open a page or pop-up thing that shows the answer and maybe an upvote and skip button would be nice. You can just click it, vote if you like it, and move on.
yeah i have things to do within the next three months, so no
having full legal text and then understandable approximations for the public to understand is good IMO because otherwise you have people reading nothing
but i guess this does free SE from legal trouble; if they release a formal version and a not-really-complete version, a case could be made that they failed to inform someone of the legal details
i wasn't asked to prove my age, though i would if SE required it, probably because even SE doesn't actually technically know who I am (or have to, at least); requiring proof of age breaks the anonymity that SE supports
Also, just as a bit of a warning, be careful when linking to things like the ToS of that site because if it's a link to an image by accident it could onebox and cause people to involuntarily connect to ph over school or work networks
(I know y'all won't, but telling someone to remind you to do something is very effective at getting you to remember to do something in my experience :p)
@hyper-neutrino That's so last-year. Now, from the people that brought you the amazing is-thirteen… [drum roll] it is out honour and pleasure to present… is-fourteen ― now with even bigger integers!
> I don't care about the emotions of snowflakes- there are widely used libraries used in production software that depend on this library. Remove this and the internet will come to a halt.
I'm just surprised by impact on the performance of my application. I was previously using a for loop to iterate over every number that's not thirteen, and yet this program is somehow even faster than that.
CMC: A generator function (or list of some sort) that produces every float64 other than 13
@RedwolfPrograms It uses a highly optimized heuristic algorithm (and caching helps too). The implementation is terribly complex, I wouldn't recommend trying to understand it
And, honestly, that's what I prioritise more over any CoC they could possibly release, and I'd rather interact with someone doing the same. Perhaps have #4: "Be respectful", but otherwise ¯\_(ツ)_/¯
And, please do it in good faith. Regardless of past history, we should treat each other as we'd like to be treated, and that generally doesn't include calling people out for potentially poor behaviour in public
@ngn I have only a vague idea what this is about (and I don't want to know more), but: this is between you and Adám. Unless you are both comfortable with discussing that in public, you absolutely should not have that conversation here, and you should only have it in the first place if both of you are happy to do so. You are more than welcome to invite Adám to discuss this elsewhere, and he's more than welcome to ignore that invitation if he wants.
But I'll leave that up to the two of you; you're both adults, I'm sure you can sort it out
@cairdcoinheringaahing an accusation of violating the ToS is not something only between two users, it's an explicit involvement of SE as a party too. that's the problem.
@cairdcoinheringaahing also, if there's no consequence for abusing the ToS for threats like this (even if that consequence is just publicly mentioning it), it's an invitation to continue abusing it
@ngn Then feel free to bring it up with SE. You can custom flag for a moderator to escalate it to staff if they feel it necessary, and staff can sort this out if so. Or, you can use the Contact Us form at the bottom of most SE pages. Regardless, TNB is not the right place to have that conversation
@hyper-neutrino Interesting. SE is a "Delaware" company, yet are located pretty much everywhere other than Delaware
They have offices in New York and London, have remote workers across the globe, have their servers in New Jersey and Colorado, but are a "Delaware company"
In which case, I believe the following to be true: in an average Minecraft world, you are more likely to obtain a block of emerald than a diamond sword. As emeralds are renewable, meaning you could (theoretically) obtain an infinite number of them, but diamonds are not (there are a finite number per world), the probability of getting 9 emeralds is higher than that of getting 2 diamonds
That generalises to any renewable resource, including beacons and Withers
I don't think this works, you are more likely to get a large number of emeralds than of diamonds, but considering diamonds are finite doesn't make it any less likely to get 2 of them
It's not like you randomly pick something out of a bag
@cairdcoinheringaahing I disagree, if you're at a certain level, given that it hasn't been mined in before, you are much more likely to get 2 diamonds than 9 emeralds
i mean what defines random in this case? if you are specifically going for emeralds, sure if you're lucky you can get it reasonably fast with coal/flesh trades
@rak1507 Perhaps when mining at a specific level. But in the progression of any given (survival) world, the probability is higher that you'll obtain emeralds before diamonds
No, but even when aiming for a specific item, you don't control if you'll get it first or not
When choosing an item out of a bag (say, an apple vs an orange), and you want an apple, there is no guarantee you'll get it, even if you can feel the items and discard those you don't want
@cairdcoinheringaahing sure, but if I'm playing, and I decide to mine at y12 or whatever it is, the chance I'll get 2 diamonds before 9 emeralds is high
if I decide to trade with villagers, it will be lower
although there is some randomness, it isn't actually random
A person is climbing a staircase. It takes n steps to reach the top.
Each time user can either climb in 1, 3, or 7 steps. In how many distinct ways can person climb to the top? (Order matters). How can we write this in Java?
This answer below only applies for 1, 2 Fibonacci, and I want to apply i...
