« first day (2960 days earlier)      last day (1887 days later) » 

12:24 AM
@ASCII-only ... and because RotateTransform(3); is buggy, I tried using for (3) RotateTransform(BitwiseAnd(Cast(q), i)); but that corrupts variables... code with workaround but try appending Print(q); to see what I mean...
 
General question: How fast is fast enough for math / list operations in a recreational language to not be irritating?
 
 
2 hours later…
2:21 AM
0
Q: Is it a Cyclops number? "Nobody" knows!

TauTask: Given an integer input, figure out whether or not it is a Cyclops Number and, optionally, the next Cyclops number after it. What is a Cyclops number, you may ask? This video (specifically the part after 10:06) should answer that. Test Cases: Input | Output -------------- 0 | falsy ...

 
2:34 AM
@DJMcMayhem It doesn't have to, but it would probably still fit in tweet even if it did
 
I just spent 3 minutes on TIO thinking my screen froze when it wouldn't let me edit the output tab (trying to edit input). I need sleep...
 
Anonymous
3:11 AM
@Οurous If I can't tell that the math/list operations are slow with regards to everything else, then they're not irritating. That said, if everything is slow, it's super irritating.
 
4:50 AM
Business cards with the golfed Mandelbrot set program
 
Python Dev... code is in C
 
QUIET YOU
I've had so many people say that...
It's really just due to the fact that C is easier to format into cool-looking patterns
Also I can't upload that version to discord since the bot thinks it's explicit...
 
I'm pretty sure this would offend people
 
In what way?
 
5:07 AM
Both people who like C, and people who don't. The former, because it's golfed, and the latter because it's C
 
5:19 AM
@ThePlasmaRailgun y'see the problem here is the fact you even willingly use python
> python
> infosec
Wait wat I don't understand
Also is that meant to look like anything
 
Anonymous
5:33 AM
nvm oops I broke it
 
Anonymous
 
@Mego or exec for any shape lol
 
5:54 AM
An F
 
@ThePlasmaRailgun with a very jagged shape :/
it's not even consistent :/
@Οurous generally as long as the whole program doesn't take 1s to run
 
6:51 AM
0
Q: It's Halloween again!

NaughtPlusProblem Description We all love a Twix (because it is the best candy), but this is the kids' first Halloween --- we gotta grab at least one of each type of candy for them. Each Halloween all the residents of Numberline avenue send out an email saying what types of candy they'll be giving away th...

 
7:41 AM
@ThePlasmaRailgun Doesn't seem appropriate for a business card at all
 
7:58 AM
@DJMcMayhem @ThePlasmaRailgun 94
 
0
A: Sandbox for Proposed Challenges

user1461607Introduction The original creator of this meme has gone blind, lost his internet and accidentally deleted all his memes. Except this one. He has this one last meme on his desktop, and since he can't see, he wants to know what this meme is. By hearing it. Challenge Your challenge is to write t...

 
 
6 hours later…
1:58 PM
I guess you'd prefer this 88 though
@Fatalize doesn't seem like a business card at all lol
 
 
4 hours later…
Anonymous
6:22 PM
@ASCII-only Yeah but that's too easy
 
8:40 PM
https://codegolf.stackexchange.com/questions/114654/print-the-periodic-table I've decided to try and x86-64 golf this challange.
I'm approaching it one step at a time, and got the first part (Drawing the table without text and without the squiggly lines) down in concept
idea i had was to use a 21 byte table that contains a 1 if a cell is at that spot, and a 0 otherwise
 
9:13 PM
People who golf in assembly blow my mind.
 
haha
if you represent the crank's position as a bit on a line (i.e. 0100), you can just check if the new position is equal to it rotated (the bitwise op) left or right, and if not it's an invalid position for the crank to move into in one step
@AdmBorkBork just so you know, however, those who golf assembly are usually insane in some shape or form. ;)
 
I'm pretty sure you can limit that to "people who code golf" in general
2
 
9:30 PM
is there an easy way to golf a loop in order to skip duplicates [0,0,0,0,1,1,2,3] etc
 
in what?
 
when you have two lists and you need to merge them in order
 
yea in what language
 
js
 
uh idk
(Tip: State the language first thing)
 
9:32 PM
well how would you do it in your favorite lang
I can probably duplicate it
 
(You dont want me trying to give you assembly advice when all you want is to know a good way to golf something in JS, not the dozen and a half ways you could do it in x86-64)
@Rick good luck :3
@Rick are the lists sorted already? And is it only handling consecutive duplicates or all duplicates
 
ya they are sorted
 
shortest way (and fastest for smaller inputs, i.e. 8 bit numbers) in x86-64 with both as a "no" is literally a lookup table. And if the input numbers are 32-bit, that means a 4GB lookup table
 
Ya I would avoid a table have space constraints of O(1)
 
dedup sO(1) is a tO((n + m)²) operation i think
 
9:39 PM
I can do it in O(n) t with O(1) s assuming they are sorted
@moonheart08 Are you are talking about bytes or space and time
here is another one, find the intersections of two lists, assume sorted, assume duplicates, assume negatives. constraints for space are O(1) and time is O(n)
I can write this ^ in 19 lines of code using 5 loops
 
CMC: Given a black box function (by any accepted method), return whether it is commutative or not, over a given set of numbers (the second input)
 
Uh that one is going to be incomputable
 
@SriotchilismO'Zaic Yep, just modified it
 
9:55 PM
@cairdcoinheringaahing so given f and set, check if a f b = b f a for every (a, b) in set?
 
@J.Sallé Yeah, more or less
 
Is the function guaranteed to be dyadic?
 
@cairdcoinheringaahing dzaima/APL, 15 bytes
or 14 but idk if ∘. will stay
 
ಠ_ಠ 15 bytes in Jelly
 
10:02 PM
Pretty much the most straightforward way to do it that I can imagine
 
someone do it in js
 
Would it be theoretically possible to do it over the set of natural numbers?
By some method other than exhaustion
 
@cairdcoinheringaahing nope
 
Can you explain why? I'm not quite sure the reason behind it
 
e.g. the function (arg1==9^102) && (arg2==6^234) seems to be pretty commutative but isn't
 
10:05 PM
I think it's because you would have to iterate over every number. If you didn't, any number could be special cased
So if you increase the range you check, I could always come up with an example where the special cased int is outside the range
 
Of course this is assuming you are using a computable language
 
But we can prove if a function is commutative with algebra, so if that were implemented in a computer, couldn't you solve it that way?
 
Something like an accelerated turing machine could likely do this
 
@cairdcoinheringaahing that'd require not blackboxing the function
 
Ah, I forgot about that part :/
 
10:25 PM
0
A: Sandbox for Proposed Challenges

BeefsterHow Many Times Have I Been Called? code-golf self-referential self-modifying Write a program that outputs how many times it has been called. It should be self-modifying such that the first time the program is run, it will output 0, then 1 the second time, 2 the third time, etc... Too lazy...

 
10:39 PM
@cairdcoinheringaahing Jelly, 9 bytes: Œcç""U$ZE
 
10:55 PM
@DJMcMayhem I think this would work for 51 bytes because 1) if you test the same pair twice but reversed it doesn't affect the outcome assuming that the black box is deterministic and 2) any deterministic function is commutative when given 2 identical arguments, so no need for combinations(s,2), I think.
 
Good point
 
Is itertools ever the answer
 
Yes. CMC: Permutations of a list
:P
 
Well...
 
@Mr.Xcoder 49 bytes: you can assume the function is already stored in a variable
 
11:01 PM
I don't think that's a standard IO form that we allow...
 
I think that holds for black-box functions
the consensus is very awry, but I think it's currently that
 
0
A: Sandbox for Proposed Challenges

liljoshuWrite a piece of code that rips out the soul of the most coders who look at it. popularity-contest Obviously, I'm figuratively speaking. Please do not write code that has the capacity to interact with souls, much less rip them out. This is the coding equivalent of an ugly baby contest, and pu...

 
> A method is allowed if it has 5 net votes and at least twice as many upvotes as downvotes.
 
+21/-11, actually, but hm...
 
Well now it's 22/11 :P
 
11:05 PM
and now it turned to +22/-11
um...
well, the other one is currently at +11/-10
so I guess it's the +22/-10 one that wins here
 
ngn
11:19 PM
@DJMcMayhem oK, 3 bytes: prm
 
@Rick new Set(array) :P (jk, probably doesn't preserve order)
 
@ASCII-only but that means I would have to create a whole new object. trying to avoid adding space :P
 
@Rick avoid adding space?
why does space matter when golfing :/
 
Wait space is not important in golf?
 
like do you think there'll be anything golfier than new Set :|
 
11:36 PM
no, it would be the golfiest way to go
I just figured that space might be a consideration O_o
I really need to up my golf game give me an easy challenge
but for like a paraplegic golfer
@ASCII-only of course it preserves order it follows iteration protocol
 
@Rick it has an order doesn't mean it preserves order
 
O it preserves order alright, even object preserve order depending on the circumstance
 
preserving order:
b=(a=[0,0,0,1,1,2,2,2,3,2,3,2,0]).filter((o,i)=>a.indexOf(o)==i)
wait what
:O so it does
@Rick xd
 
booyakasha
a better question would be, when is order not preserved.
@ASCII-only lets do better for (let i of new Set([0,0,0,1,1,2,2,2,3,2,3,2,0]))i
 

« first day (2960 days earlier)      last day (1887 days later) »