So, I'm learning C++ programming language, and I'm on "for loops". I've been experimenting with it a little bit, and I found that something weird (to me) happens when you put a value above 5 on my code.
#include <iostream>
#include <vector>
#include <string>
#include <fstream>
using namespace ...
A fast algorithm for the spike distance
Given two sorted arrays of floating point numbers X and Y, we can define the spike distance as follows. The distance is defined as the minimum cost associated with the transformation of one point pattern X into a pattern Y by deleting, adding, and moving p...
It hasn't been very well publicised, but StackExchange is going to drop support for most third party logins in less than a month from today. This could affect a lot of the old-timers, because back when we joined the site it didn't have its own login accounts. Therefore this is a public service an...
Challenge
You are given an array of three integers as input - [min_value, max_value, sample_size]. Your task is to output a diagram in any convenient format, that shows the frequency of numbers in the min_value-max_value range showing up when a random number is picked sample_size times. With lar...
Wow, that question was blasted into oblivion (the s/mime email challenge). Just because a challenge requires some domain-specific knowledge doesn't mean it's a poor challenge. Not every challenge needs to be accessible to every person.
Strongest Sentence
Given two sentences, calculate and output the strongest one.
The strongest sentence is the one which the sum of all it characters decimal codes is the biggest. Example given Hello World and Hi Maria
Input => Hello World
H e l l o W o ...
@AdmBorkBork I tried just getting an example or a quoted part of the RFC so that the question was self-contained but the author responded that it was easy and you shouldn't need the RFC and then he proceeded to remove the RFC link from the challenge...
I don't think what I was asking was unreasonable and I think it would have made peopel chill
that being said I didn't downvote or vote to close
I think it is just as specified as codegolf.stackexchange.com/q/76379/42963 (Simple TCP Server), which is one of the more-highly-regarded challenges on the site.
@AdmBorkBork I think this is a perfect example of a certain type of bogus question: the one which can only be answered by using by using a library or builtin to do most of the work.
It says "do X" without really defining what exactly is needed to do qualify as doing X.
Thus the only way to be sure is to pick a library advertised as doing X that everyone can agree does X.
There's no scope for shaving it down to the absolutely minimal functionality because the boundary is not clearly drawn.
Yeah, I'm not a fan of questions that ask you to conform to a enormous protocol are basically "Does you langauge have a library for X, if so then call the function that does this task".
@cairdcoinheringaahing re (But forcing a different result in a tie makes my example program increase to 12 bytes): lol, my approach is 5 bytes and outputs both in case of a tie... But I guess you use some other quick like Þ for example :P
I'm not a huge fan of that one either (the ethereum), but at least it has a reference implementation and seems like it would be easier to verify the task is done successfully. I honestly don't know how to verify an email was signed properly by looking at the code at all, and I'm not positive the OP does either, or the question on SO wouldn't still be open.
It also doesn't help that AFAICT, the OP's only responses to questions have boiled down to "this is easy".
The ethereum challenge and tcp challenge both have test cases and the ethereum one even has a reference implementation. that's literally all i was asking for in the email challenge
OP couldn't write an implementation himself but was touting that it was easy
@feersum It most definitely can be answered without a library or built-in. How else do you think that library or built-in was created? Just because it's not a 5 byte solution doesn't mean the question is bogus
I'd like to see more practical challenges like that rather than "implement this oeis sequence"
it actually forces answerers to think about the problem and opens a lot of opportunities for golfing instead of just using some golfing language with 1000 built-ins
I have to use Windows for work again and I think I've determined that the thing I miss most is the fact that I can't summon fancy progress bars with dnf upgrade
Getting a list of all my outdated software about to become new is like the most satisfying thing ever
@Pavel You and I have very different experiences of SO.
That seems completely alien from my experience
@JoKing Hey I was thinking about making a Lost answer to this, but I'm hitting some conceptual walls. Since your the lost expert and seem to always be up for a tough challenge, I was wondering if you wanted to collaborate some time.
one of the more revolutionary features of my incoming wsbsite, which is being lovingly crafted in hand made C by Oompa Loompas in the tarpits of hell.., is that there is a "random tweet' button which can be used as a more consumer-friendly way to enjoy my tweets...
@Adám I get extremely paranoid whenever I try to write an email fearing I'll make any kind of mistake and then I find myself unable to actually send the message
@LuisMendo I feel like right now there are not enough constraints, because the funciton only seems to be analytic in one point (see my question above). If the power series converges in the whole domain, I think you can just directly compute the limit of xf'(x)/f(x) by term wise differentiation and maybe applying some de l'hôpital or so
@LuisMendo sorry, I just did some computations and tried reformulating the problem, but right now I'm struggling with taking the derivative of polynomials^^
last try for today.. could anyone take a look at codegolf.meta.stackexchange.com/a/16580/9207 please and let me know what I can do to make it acceptable? It was disliked when it was on main
I personally think it's an interesting algorithms question
the point being that properly we should be measuring running time as a function of the length of the input in bits. But because that's really fussy we ignore the number of bits in an integers. But this slackness leaves you open to abuse if you are not careful
so an algorithm that run in O(p_d) time should properly be regarded as exponential time
as it is exponential in the number of bits needed to represent the integer p_d
@flawr could you explain your concern about using the word "integers" in the question?
Earth mover's distance code-golf
Dupe check: Do we already have a challenge to compute the Earth mover's distance between two 1D arrays?
So, I'm learning C++ programming language, and I'm on "for loops". I've been experimenting with it a little bit, and I found that something weird (to me) happens when you put a value above 5 on my code.
#include <iostream>
#include <vector>
#include <string>
#include <fstream>
using namespace ...
Strongest Sentence
Given two sentences, calculate and output the strongest one.
The strongest sentence is the one which the sum of all it characters decimal codes is the biggest. Example given Hello World and Hi Maria
Input => Hello World
H e l l o W o ...
