(Inb4 caird or hyper say "oh it's only quiet because it's a weekend and people only use code golf as a means for procrastination during the work week")
This is a free hivemind, I'll ask whatever tf I want
(Inb4 redwolf says "ah but actually it isn't because hyper is of a higher level in the hivemind than you hence you don't get to freely ask those questions")
This seems like the time where someone like razetime, caird or someone else would say "you guys realise Lyxal is intentionally controlling the chat by encouraging people to make jokes that copypasta exactly what Lyxal tells you to say", consequently proving my point.
And of course no one copied my previous message because that would be admitting that people fell for this scheme. This means that the only way for me to win is to predict that the next message will be contrary to this message; if it is, that means the message will agree with this one and consequently play into the trap I've set. And if it isn't (the next message somehow happens to agree with this message), that means the message is acknowledging the message of mine before this.
my friend, who refused to watch anime and insisted on not, was finally convinced by my brother to watch i think it was Your Name, and has now watched significantly more anime than i have, lmao.
i either take like 3 days per episode or watch like 8 in a day. sometimes both for the same anime. i usually do finish series though, though it sometimes takes a while
@Anush I'd brute force it for fun, but there's about 3.6 billion permutations of two words in my dictionary so...no thanks :p
You could probably guess it with pretty good accuracy using some filters and stuff, but if you want a general solution to the problem I'd be surprised if it's not NP-somethingorother
if your strings have length N,M, there are only NM substrings that can be formed that require both strings, so you will hit a point where the number of substrings in both words alone for some string you've scanned is higher than the possible number of substrings in any shorter test case
ok, how about inter+relationships (29): a,at,elation,er,err,hi,hip,hips,i,in,inter,interrelation,interrelations,interrelationship,interrelationships,ion,ions,la,on,re,relation,relations,relationship,relationships,sh,ship,ships,terr,ti
I don't think we can make misunderstandings (31) by joining two words
I want people to start being able to use tio-api and am working on the readme, but I still don't have a license.
Can anyone remind me what the nice and friendly choices are?
I'm a bit conflicted because I want it super FOSS, but I do also like validation :p
So I'm hoping to have it totally open, usable and modifiable, but have the license say something about crediting/citing the source. It doesn't have to be enforced, but if it could be in the license that crediting was highly encouraged, rather than me having to say it, that'd be nice!
Or is that at odds with the open-source spirit/unconventional to ask?
Eg. I'm working on a credits.md for this project, and will do so for all other projects that have contributors. But I know most people don't religiously that.
basically formed words by starting with 3-letter words and finding 4-letter words that were a 3 letter word + a letter, then 5 letter words (4+1), then 6 (5+1)
I have integers 3..10. I want some simple function so that f(a) + f(b) < f(a+b) but f(a+1) + f(b) < f(a+b) for any a, b I choose from the range. What the easiest way to do that?
Avoid traps, run to an exit! restricted-source
Code layout
Your code shall declare:
One kind of characters as the protagonist. The protagonist must appear exactly once in the source.
One other kind as the trap. Traps must appear once or more.
One other kind as the exit. Exits must appear once ...
@Anush iirc, there was contention about how much of Mathematica they were willing to let Dennis use. I think they disallowed him for using some of the downloadable data packets and a couple of other things
@SandboxPosts Hi all, I have a question about the challenge I posted: is it possible to have a competition where the test cases are randomly generated?
@N3buchadnezzar why do you think it's not recommended? There's no reason not do it, and no reason to hide them, as long as all answers are subjected to the same test cases
@ValentinBrasso I think as long as all the answers have to do the same set of tests there's no reason not to use randomly generated ones
@pxeger I think we agree here. What I thought Valentin asked about was giving random test cases for each answer. If every answer is tested against the same cases that is totally fine. (But is it really random then)
@PyGamer0 ;-) If there are any features you want included just give me a shout. Atm you can search fuzzy search for commands and have them inserted automatically. You can also cycle similar characters. E.g cycle through all the letters which looks like M (or cycle through the monads, dyads, quicks etc seperately) Definition of commands are also available, Lastly you can run the code directly. It's not much but it is something.
:p Need to figure out how to actually push it to git in the proper Vim plugin format, a bit of a hassle. So at least two weeks. But idk, its getting there
can anyone help me with the simple math please. I have integers 2...10 and the variables x and y are chosen from those integers. I would like a function f so that f(x) + f(y) < f(x+y) but f(x+1) + f(y) > f(x+y) for all x, y.
I think f(a) = a^{1+epsilon) should be it but what is the smallest epsilon that would work?
Sliding dice
We have 3 dice in a square dish. The dish is 8 units wide and tall and each die is 3 units wide and tall. The dice are facing up each with a different number on their top face.
111..222
111..222
111..222
........
........
333.....
333.....
333.....
Then we play a game. At each ste...
@ValentinBrasso If your challenge scores based on the outputs provided in the question, the test-battery tag applies, and I'd suggest leaving in a bit saying "The test cases are subject to change if necessary, to prevent answers from optimising for them"
It always feels so good optimizing code. Like it works, but then you build good functions, extract variables, perhaps use a better algorithm etc. And you know what? It magically still works :p
Using the builtin sorting algorithm in your prefered language, perhaps using C if you need it to go really fast?
Timsort in python is pretty good, not sure what the default algorithm in C is
If you are looking for something a tad slower, quicksort is really great, and trivially easy to implement. Implementing these algorithms for learning is superb, but in production code you should always rely on the builtin libraries.
Avoid traps, run to an exit! restricted-source
Code layout
Your code shall declare:
One kind of characters as the protagonist. The protagonist must appear exactly once in the source.
One other kind as the trap. Traps must appear once or more.
One other kind as the exit. Exits must appear once ...
Sliding dice
We have 3 dice in a square dish. The dish is 8 units wide and tall and each die is 3 units wide and tall. The dice are facing up each with a different number on their top face.
111..222
111..222
111..222
........
........
333.....
333.....
333.....
Then we play a game. At each ste...
