CMC: Make a function that's vertically asymptotic at x=0 and horizontally asymptotic at y=1 and y=-1, and not asymptotic anywhere else (if that's even possible)
@HyperNeutrino Anyway, see the InteropServices bit? That's actually the .NET numeric type being marshalled to a C++ type, and then calling the C++ sizeof.
@ASCII-only because definetly not global because global is evil but then Math namespace is yucky and verbose and is adds a lot of extra code making it harder to scan expressions
One of Unix core commands is yes which simply prints infinity number of letters y.
I read a blog post (https://matthias-endler.de/2017/yes/) how people optimize it to output y with speed of 10G/s.
I tried to achieve similar speed with Java but I stopped at 70M/s.
My code is:
public class yes ...
Output all permutations of a vector
The challenge is simple: Output all unique permutations of a list. You may assume you can run the program indefinitely, but you may not assume that you have a larger memory than you have.
That means, if you run your program long enough, then all permutations ...
CMM: Does an answer to a code-golf challenge for which the writing of the solution itself is already challenging, but is not very well-golfed (e.g., leave extraneous whitespace) be considered serious contender?
A serious contender is a submission which makes a serious effort towards optimizing the submission's score within the chosen language(s) and other choices (such as algorithm choice or optional restrictions/bonuses taken).
This is somewhat subjective, in that the best answer in my opinion is "you...
No, I am referring to the questions (reply to :40710712 )
Anonymous
Even if it takes a lot of effort to write the code, only the effort taken to optimize the code for the winning criteria matters when considering whether or not it is a serious contender.
I read through this, and felt sorry for anyone who tries it :P
Anonymous
Consider this: would a complex, enterprise-designed piece of software with meaningful variable names, plenty of useful comments, and a full suite unit tests be a serious contender for code golf?
I really want to make a 2D pattern compressor for SOGL but I don't even know where to start.. making it would be pretty much making a miniature language by itself
Inclusion-Exclusion lets you calculate the sizes of some unions and intersections between sets knowing some of the other values. I won't explain it exactly, but your challenge is to visualize inclusion-exclusion on a Venn Diagram.
Because I'm nice, you'll be using rectangles, not circles.
You w...
I don't even know why they gave us a Chromebook... it's just preventing my parents from letting me bring my real computer to school (real as in something that actually works)
I mean the main problem with installing Linux is then they don't have control over the computer anymore.
My version of Chrome OS is restricted, monitored, and probably remotely accessible, though they probably don't monitor it because that's a privacy infringement and that's a big thing here :P
I mean there's a hardware switch that prevents me from booting into developer mode and resetting the computer or formatting, which I'd have to remove physically to do anything
@HyperNeutrino Can you change this to code-challenge? I think it is already too challenging to just write a code, but if it is code-golf then the answerers must golf it and thus they lose the motivation to answer. I'm going to answer some unanswered challenges, anyway.
@J.Salle Probably not. Most school-issued laptops have the BIOS locked down, so you'd need to short the CMOS battery in order to even boot from anything other than the hard drive.
One of Unix core commands is yes which simply prints infinity number of letters y.
I read a blog post (https://matthias-endler.de/2017/yes/) how people optimize it to output y with speed of 10G/s.
I tried to achieve similar speed with Java but I stopped at 70M/s.
My code is:
public class yes ...
Output all permutations of a vector
The challenge is simple: Output all unique permutations of a list. You may assume you can run the program indefinitely, but you may not assume that you have a larger memory than you have.
That means, if you run your program long enough, then all permutations ...
Inclusion-Exclusion lets you calculate the sizes of some unions and intersections between sets knowing some of the other values. I won't explain it exactly, but your challenge is to visualize inclusion-exclusion on a Venn Diagram.
Because I'm nice, you'll be using rectangles, not circles.
You w...
