« first day (3149 days earlier)      last day (1680 days later) » 

12:57 AM
@primo What do you think about this
 
A _
1:16 AM
@H.PWiz This is a pi-calculating program.
 
Right
 
2:08 AM
@H.PWiz sometimes it's hard to tell if two iterations are just reformulations of the same thing
but i don't recognize this one either
 
 
2 hours later…
3:55 AM
-2
Q: Convert a Forsyth-Edwards Notation input file to ASCII java

JorshlynThe program must load the data, process it, and output the results. The output should look like the text box on the back page. The output should number the chess boards, starting at 1. For each board, show a text representation of the chessboard with the pieces printed in the correct positions. T...

 
Anonymous
4:36 AM
5 hours of trying to hack around bugs with ScrollView in React Native is making me regret becoming a mobile dev
 
7:38 AM
0
A: Sandbox for Proposed Challenges

xnorSolve a cubic equation code-golf (Is this really not a duplicate?)

 
 
2 hours later…
9:37 AM
@primo So, this is just a fudged version of 2+1/3(2+2/5(2+... I was interested to see if that was obvious
 
10:17 AM
0
A: Sandbox for Proposed Challenges

PureferretIs this number part of a Collatz Prime sequence? A Collatz Prime is defined as such: $$p_{2} = \frac{3*p_1+1}{2}$$ Where p1 is the input prime, and p2 is the output. Here are some test cases: 1 -> (3*1+1)/2 = 4 : false 3 -> (3*3+1)/2 = 5 : true 5 -> (3*5+1)/2 = 8 : false 7 -> (3*7+1)/...

 
 
2 hours later…
A _
11:52 AM
 
12:36 PM
1
Q: Permutations in Disguise

flawrGiven a \$n\$-dimensional vector \$v\$ with real entries, find a closest permutation \$p\$ of \$(1,2,...,n)\$ with respect to the \$l_1\$-distance. Details If it is more convenient, you can use permutations of \$(0,1,...,n-1)\$ instead. If there are multiple closest permutations, you can outpu...

 
@H.PWiz i don't think it's possible to derive, infer, or transform one into the other, because they aren't identical
i suppose it's somehow "close enough" that it still converges by some coincidence
 
12:52 PM
@H.PWiz this might interest you: bit.ly/2kfW7v0
it's collection of pi iterations which don't require an arbitrary precision sqrt
 
0
A: Sandbox for Proposed Challenges

flawrRandomize \$SL_n(\mathbb R)\$ Given a positive integer \$n > 1\$, return a random element from \$SL_n(\mathbb R)\$. Details \$SL_n(\mathbb R)\$ is the set of \$n \times n\$ matrices with determinant \$1\$. In theory the output must cover the whole \$SL_n(\mathbb R)\$ (that is, if the RNG you'...

 
(excluding dozens of ramanujan-sato series which converge slower than simpler iterations, and all machin-like formulas except for the "original")
 
1:09 PM
@H.PWiz actually, now that you mention it... you divide through by (n-1), and then the next iteration multiply by n
 
 
1 hour later…
2:12 PM
@primo you're a serious collector :)
for code-golf.io I assume?
 
@flawr just a personal interest
comes in handy every now and then, though
 
@primo That second one is (at least visually) quite similar to my cgio/pi
(Which I converted into the form 1+a*(1+b*(1+... above)
 
combine neighboring terms of the leibniz series weighted 3/4 : 1/4, move the leading 3/4 to the lhs (resulting in pi/4 - 3/4), then apply euler's transform to the remaining terms
that's how I derived it, anyway
 
Ah. Looking at it, I can't see the steps to change it into mine.
 
the best i could manage with that one was 67
 
2:23 PM
@Mr.Xcoder If you had stopped then I would have caught up now!
 
2:34 PM
@flawr Congrats!
Tbh the majority of my rep over 30k mostly comes from passive upvotes
2
 
3:03 PM
@Mr.Xcoder And let's not forget our good friend: Someone randomly answered an old challenge of mine and bumped it, so now it's getting new answers and upvotes for a week
 
A _
Good challenges always get upvotes regardless of the time.
 
Dang, I must write crap
 
@DJMcMayhem So damn relatable :)
 
3:38 PM
0
A: Sandbox for Proposed Challenges

Yimin RongFind Magic Powers of Two Represented in base 3, there are some integer powers of 2 where the digits are a permutation of the next power of 2. Some examples: 2⁵ in base 3 is 1012, whereas 2⁶ in base 3 is 2101, both have one 0, two 1’s, and one 2. 2²⁷ → 100100112222002222 vs 2²⁸ → 2002010022210...

 
4:11 PM
codegolf.stackexchange.com/questions/106745/no-strings-attached - Hmmmm. For any n, I can easily write a /// program that works for all inputs of length up to n.
I can't think of a way to do it for unbounded inputs.
But for bounded inputs, the program is /a\A///A\a///b\B///B\b//.../z\Z///Z\z//, repeated a number of times equal to at least half the length of the input.
(Replacing ... with the appropriate code for C through Y.)
 
4:39 PM
Oh nifty -- I now have 250 bronze badges.
 
5:16 PM
BUTTER GOES REALLY WELL WITH POPCORN
 
0
A: Sandbox for Proposed Challenges

BeefsterCreep Spread Territorial Control (WIP) king-of-the-hill grid Blah blah blah flavor blah blah blah something about Starcraft blah blah blah Gameplay Initial State There is a 200x200 grid of square cells. There are four creep spread factions competing for dominance of this territory beginnin...

 
5:33 PM
CMC: Generalised Quine: Given a black box function that takes in a character and outputs a value (that can be any type), output your program where every character has been passed through the function. E.g, if f(x) = lowercase(x) and your code was Ab123, you should output ab123. You can assume the function is implemented for all characters in your program (so no int(x) for non-integer characters etc.)
 
@cairdcoinheringaahing Can I take a string of code if my language has no black-box functions?
 
Yeah, any common sense representation is fine
 
1
Q: Olympic game scoring

JuanCaThe challenge is to write a golf-code program that, given n positive real numbers from 0 to 10 (format x.y, y only can be 0 or 5: 0, 0.5, 1, 1.5, 2, 2.5 … 9.5 and 10), discard the lowest and highest values and shows the average of the remaining, in x.y format (y can be 0 or 5, rounded to closest)...

 

« first day (3149 days earlier)      last day (1680 days later) »