Introduction
Given an undirected graph G, we can construct a graph L(G) (called the line graph or conjugate graph) that represents the connections between edges in G. This is done by creating a new vertex in L(G) for every edge in G and connecting these vertices if the edges they represent have ...
I had an idea - code golf challenge - shortest sequence of keyboard inputs that creates a program of the language of your choice to do some code challenge
but that would just become either writing the entire thing in vim for verbose languages or i<program> in shorter ones (maybe with a few tricks like bo<c-p> for bottles)
@Downgoat I mean, I don't, have to, but In Fedora 28 everything still depends on Python 36 so if I install Python 37 on the side I'll just end up with two pythons
@Adám ẎƬ: concatenate elements until you can no more, keep every iteration in an array, including the beginning; Ṗ: pop the last element (iteration), who cares about the length of the flattened array?; Ẏ: concatenate elements (remaining iterations), let's finish it off at once, shall we?; Ẉ: get the length of each element; =L: compare all lengths to the input's length; Ạ: finally, check if all elements are truthy (well, 1 in this case, all should be equal to the input's length)
idk what it is good at, but it is kind of functional, and im currently editing the code online so sending the link would not help very much, but i'll send one when I finish it
I was trying to solve the knotty challenge before we publish it, and this mini-problem came up naturally there. The arrays represent the coefficients of Laurent polynomials (polynomials where x can be raised to negative powers) from x^-n to x^n.
@ngn Yeah, we have to write an extension which looks at whichever character is pointed at (if possible, else: selected) and looks it up in the language bar, and then displays a tooltip.
Isn't there a tool which takes a Jelly program and displays each characters with its description?
@quartata ML has nothing to do with it; the challenge is unclear. I honestly can't tell if Arnauld's answer is valid or not. Its magic numbers were most likely chosen to optimize the score.
Not really. Should the challenge be fixed or should it be thrown into purgatory?
Furthermore, I'd say that hiding the test set isn't really necessary for a challenge where the winning answers are going to be ML solutions. If those were optimized for the test set, you'd know because they'd be absurdly overfit
I think the challenge is clear enough unless you need a very explicit definition of what "optimizing for the test cases" means... which I don't think you should
there's even a metapost about what the means that was linked by mego
in this case I feel like the answer is at fault more than the challenge
though maybe Arnauld's answer works across all headlines, magically
ML seems to be the only "correct" way to solve this challenge and is likely(?) what mego was going for
The powers that be want to be able to quickly convert any number they have into there own number base using any format they would like.
Input
Your program must accept 3 parameters.
Number: The string number to be converted
InputFormat: the base string the number is currently in
OutputFormat:...
model is actually much bigger than I expected it's 12MB.. previous model had 83% val acc on all posts and still for 100% but was only 3MB
Anonymous
I'm going to add a hidden test case of 200 headlines (100/100), and require that scores are no worse than 20% less than the scores on the test cases. Does that sound reasonable?
The powers that be want to be able to quickly convert any number they have into there own number base using any format they would like.
Input
Your program must accept 3 parameters.
Number: The string number to be converted
InputFormat: the base string the number is currently in
OutputFormat:...
