I can use many of the site's features while unregistered. I am looking for a simple explanation of what benefits a user can have from registering.
For more information, see "Why should I create an account?" in the Help Center.
Return to FAQ Index
or at least, they've listed one. i guess maybe they didn't confirm it from their inbox or smth
@cairdcoinheringaahing you have my approval to "borrow" that line :D
see that falls under the category of things that probably aren't particularly professional or official-looking but it's some guy plagiarising i don't care :p
@RedwolfPrograms the part about it that is so horribly wrong is that I accidentally tried to declare the operator+= as a method of LinkedList<T> instead of LStack<T> inside a file which is 100% LStack
guess who has an assignment to write an algorithm within specific complexity constraints in a formal model of parallel computation where it's gotten hard enough to reason about that he has implemented a simulator for the formalism with far too many python generators and a stack for process-local data and is now implementing a binary search in it
writing an interpreter isn't actually part of the assignment it just seems easier than actually working through the formalism by hand for making sure the expression i have for the right length to cascade at actually gives me the right work and span bounds
Given a string containing only the characters -, |, + and newline determine the longest straight line contained in it. A straight line is either an uninterupted run of -s and +s in a single row or an uninterupted run of |s and +s in a single column.
So for example:
|
| ----
|...
well that diverted the conversation, so let's instead talk about Code Golf and Coding Challenges Stack Exchange as we always do in this very on-topic and focused chat room
Having said that, I'd totally sponsor us if I had a corporation that had the capacity for sponsorship
I have no idea what null does, but does it, by any chance, just ignore what it's argument is and return False, meaning that [ id ] is invalid, but just isn't evaled in the first one?
The thing is that functions are not comparable, since checking equality would require solving the halting problem. And by extension lists of functions are not comparable because if they were then [a] == [b] would have to compare a and b. Comparing to the empty list is a degenerate case where we can always determine equality, so it trips people up.
On the other hand, if a function's domain is finite and its codomain is Eq then it's mathematically comparable, though it's practically (almost) meaningless I guess
@WheatWizard To my instinct, the natural minBound for Bounded b => Bounded (a -> b) is \_ -> minBound, and the same for maxBound, whatever a is
Python has "built-ins" and "standard libraries" clearly separated in its docs. The former are in Libraries Reference chapters 2-5, and the rest belong to the latter
@Bubbler This is interesting. Bounded doesn't seem to have any rules, but I would expect that there would at least be a partial ordering which the minBound is a terminal object, which would not hold for your given type.
The default Samsung keyboard does have quite a few accented chars and some non-ascii special chars that happen to be also Jelly chars, but I don't see dotted letters
[@pVCaecidiosporeadduced: 59251247]
0
STDERR:
maximum recursion depth exceeded while calling a Python object
Most recently popped arguments: [[], 0]
Final stack: []
[@pVCaecidiosporeadduced: 59251261]
0
STDERR:
maximum recursion depth exceeded while calling a Python object
Most recently popped arguments: ['00', 0]
Final stack: []
hmm. using e to get every zeroth letter of a string give one of two different errors depending on the order of the arguments, even though it performs the same function
getting every ath letter of b gives a recursion error, but getting every bth letter of a gives an error about the slice step being 0.
vyxal's pretty well designed and not as much so executed :P
also why is the exponent function called "exponate"
@AaronMiller this is because types == (str, Number) is coded as a separate if block but the rest are part of the type-map block, which doesn't have a case for (Number, str)
@WheatWizard Comment markdown leaves a lot to be desired... I edited the test case to what I had intended.
One iteration of my Pip submission could have saved bytes by concatenating the list of lines together, which would turn that test case into |+--+|, giving an incorrect answer of 4.
(Pretend there's spaces on the outsides of that. Chat markdown leaves a lot to be desired... :P)
@RedwolfPrograms What's your opinion of Pip's -r flag? It changes the input source from command-line args to stdin, which basically just makes it easier to enter the input, especially on TIO.
I don't think there's any legitimate use for them in an answer, but they wouldn't be cheating if you just used them for their intended purpose of timing out after a little while
If you used that in a challenge requiring timing out after a certain amount of time, it'd be cheating
E.g., submitting "while 1" with T would be flag abuse for "make a program that runs for 60s then terminates'
I definitely think that flag usage should be more objective if possible, and that flag abuse is bad, but I also feel a bit more lenient about what actually constitutes flag abuse.
@RedwolfPrograms I think it sets up an unobservable requirement to say that an output of Hello, World! is valid if it's the string "Hello, World!" but invalid if it's the list ["Hello"; ", "; "world"; "!"] which the language outputs by concatenating all the values.
I have an idea for a golfy way to represent programs in 2d languages
Probably already exists
Basically, you follow the path the IP would take, writing down any non-duplicate instructions along the way
And for instructions that can branch multiple directions, you do it prefix-style
E.g., if there was a language where . was where the IP started (and it began by going right) and , ended the program, and slashes are mirrors and x sends the IP in a random direction, you'd write this program: as
Given a non-negative integer up to $999\,999\,999$, write it in English. The input number can be in any form other than English (though you'll typically want to use the native integer ty...
def RedwolfPrograms(f):
"""decorator to fix a function according to Redwolf's rules"""
def inner(*args, **kwargs):
return "".join(c for c in f(*args, **kwargs) if c.lower() not in {*"jlmhe"})
return inner
@RedwolfPrograms
def greet(name):
return f"Hello, {name}!"
Given a string containing only the characters -, |, + and newline determine the longest straight line contained in it. A straight line is either an uninterupted run of -s and +s in a single row or an uninterupted run of |s and +s in a single column.
So for example:
|
| ----
|...
