« first day (1397 days earlier)      last day (1949 days later) » 

1:23 AM
The last 5 regex golfs have all practically been the same thing XD
5 hours later…
5:56 AM
:/ I want to comment more on the circular quine post but I'm afraid I'm being too harsh atm
1 hour later…
7:06 AM
We need the xkcd bot that SX have...
@BetaDecay is it anything like this one?
7:21 AM
@BetaDecay Which one ?
7:39 AM
@Optimizer It just displays the latest xkcd, everytime a new one is posted
7:59 AM
@BetaDecay I meant which bounty are you talking about
8:27 AM
@Optimizer Oh yeah, Manhattan Police
9:00 AM
That is awarded ASAP
so yeah, even before you pinged me that day telling that you gave me the bounty, I had already gotten it
1 hour later…
10:12 AM
@Optimizer how come you deleted your digit divisibility answer?
10:25 AM
prays to the RNG gods I hope randomly generating regexes gets me something useful...
:D good luck with that!
:P I just don't want to be stuck with reusing the same pattern over and over, even if I came up with it :/
The most amusing thing it's come up with so far is \...]. , which I thought was weird because I tried to clean up regexes to remove extraneous chars
But the last . is needed to not match a fail regex
11:06 AM
@PeterTaylor it seems I am not the only one mystified by the MO answer
@MartinBüttner OP asks for true/false boolean values
makes the code 30 bytes plus
no use
CJam doesn't have true false. truthy/falsy is as close as it gets for all practical purposes.
but OP says its not valid
its his/her rules
specially mentioned
@Optimizer asked for clarification... sounds to me like the OP assumes that every language has a boolean. currently, you can't even participate in C.
11:22 AM
C doesn't have boolean ? :O
Q: Using boolean values in C

neuromancerC doesn't have any built in boolean types. What's the best way to use them in C?

esp. the first comment "C does have boolean type. At least there is one in the most recent standards."
11:58 AM
btw, I had to laugh about the circular numbers challenge today... I spent half the day yesterday thinking about what kind of roman numeral challenge we haven't done yet :D
@MartinBüttner I think its perfectly alright to specifically ask for boolean values
that's upto the OP to decide
12:54 PM
I'm winning a code golf :D
I've never won a code golf
1:06 PM
And with Marbelous at that :o
@Sp3000 I'm at least as surprised as you are
I think the best way to summarise that question is... pick the right tool for the job :P
And for once CJam might not be it :P
The insomnia answer looks crazy too, I don't understand it
1:24 PM
@Optimizer OP just updated
@overactor sweet :)
@MartinB├╝ttner I was first doing Gottfried Leibniz
with only AF<>~.
God, that was a terrible idea
CJam is really gaining a lot of speed, isn't it?
looks like it
Q: How do I draw a pair of buttocks?

Simpleton JackI'm trying to develop a function which 3D plot would have a buttocks like shape. Several days of searching the web and a dozen my of own attempts to solve the issue have brought nothing but two pitiful formulas below. They have some resemblance to the shape I want, though not quie. Could you h...

This is hilarious
@FireFly OH GOD
@MartinBüttner Hmm. Although, there is no point as cjam is not winning anyways :P
1:35 PM
true... I might be able to shave off one more byte, maybe two if I'm really clever, but I won't tie with Pyth.
really ?
I wanted to do KEI in J, and while the characters seemed promising at a glance, they're not sufficient :(
if you can 2, then I will accept that you are better than me in CJam ;)
@FireFly KEI?
1:38 PM
I'm already having a hard time finding one, but I feel like it should be possible
Ken Iverson, the guy behind APL & J
@FireFly That would have been pretty cool
Or rather, "Kenneth E. Iverson"
especially since I've got two independent 15 byte solutions
well, they are both similar to mine as there are not many ways to do it anyways
at least 1 of them is very similar
1:39 PM
there's one more way... but unfortunately CJam only has prime factorisation and not a function to get a list of divisors
(get all divisors, intersect with digits)
#$'()+4BY]_y| is the letters one would have for "Kenneth E. Iverson"
There's single-quotes, that's always useful... no I/O or integer→char conversion though :\
@Optimizer can you think of a shorter way to get all divisors of X than X,:){X\%!},
divisors between 1 and 9 would also be sufficient
2:13 PM
I'm giving up... I can't find a shorter way
there must be one though... can't be that you need 11 bytes to get divisors in CJam
Does cjam have a prime factor function?
Could you use that, and then find the products of all the subsets?
but I think getting the power set of that also takes too many characters
Yeah its too long in Pyth too :/
2:20 PM
@MartinBüttner will give it a shot in an hour. office right now.
@FryAmTheEggman I remember that Dennis once had fairly concise CJam code to get the power set using cartesian products, but I'm not sure how to find that...
Where is he anyways ?
he's called sudo now
what ? why ? Dennis == sudo ?
@Optimizer Yes, he changed his name.
2:27 PM
But still, he is inactive on PPCG, right ?
@MartinBüttner I tried running this query but didn't find anything. You remember anything else about it?
@FryAmTheEggman I don't think that particular question was about divisors
I think a data.SE search through the comments containing "power set" or "powerset" might help, because I'm pretty sure I mentioned it in a comment
@Optimizer less active than he used to at least
I've tried both power set and power so far...
I miss his CJam answers. Some used to be really neat
This is the shortest I've found so far with using prime factorisation: _Ab1a@mf{1$f*+}/-! (that's 18)
basically I start with [1], then I get the prime factors. and then for each prime factor, I duplicate the array, multiplying one half by the factor.
I don't think I'll shave off 3 bytes from that to even tie with my other submissions
I mean, I need 12 bytes here to get the divisors. the straight forward approach had 11.
2:59 PM
@Optimizer so where is your <400 12 days of christmas submission? :P
@MartinBüttner - :XAb9,:){X\%},0+&! is the way u were suggesting
and the christmas one - I left it in between
17 bytes
hmm, can be made shorter. a sec
@Optimizer I had :XAb9,:){X\%!},-! for 17
that doesn't account for 0
or does it?
why not?
ok i see.
so again , same 17 bytes ..
3:04 PM
I still can't believe there's not shorter way than X,:){X\%!}, to get all divisors
is there any operator for logical and ?
e& I think?
ok, the site is down, so not able to see from the site itself
so, no luck in less than 17 with that approach.
3:30 PM
@MartinBüttner codegolf.stackexchange.com/questions/25157/tower-of-hanoi-sort seems to be the only place you said "power set" or "powerset"...
Oh I think I found it
A: Combinatorial products of unique primes

sudoCJam, 13 bytes 1aq~{1$f*+}/p Reads an array (e.g., [2 3 5 7]) from STDIN. Try it online. An anonymous function would have the same byte count: {1a\{1$f*+}/} Example run $ cjam <(echo '1aq~{1$f*+}/p') <<< '[]' [1] $ cjam <(echo '1aq~{1$f*+}/p') <<< '[2 3 5 7]' [1 2 3 6 5 10 15 30 7 14 21 4...

"Subsets" ;)
@MartinBüttner Finally Dennis answered. Supposedly 0d% works!
3:51 PM
@FryAmTheEggman :( that's exactly what I came up with
@Optimizer damn that's good
4:22 PM
Wow, the OP chose "No" as the thing to print when the square root question fails
And someone came up with Prolog
that feeling when you finish your pizza and want another one :(
Ahaha CJam, there we go
What is wrong with this Perl?
my @PhiNotPi = ("Test1", "Test2", "Test3");
my @Doorknob = ("Test1", "Test2", "Test3");
my @Sp3000 = ("Test1", "Test2", "Test3");
my @grc = ("Test1", "Test2", "Test3");
my @FryAmTheEggman = ("Test1", "Test2", "Test3");
my @MartinBüttner = ("Test1", "Test2", "Test3");
my @Optimizer = ("Test1", "Test2", "Test3");

my $top_left     = $PhiNotPi[0];
my $bottom_right = $PhiNotPi[2];

print "$_\n" for @PhiNotPi;
you pinged everyone in that code
Exactly :)
I don't think it should do that.
But seriously, that doesn't run.
And this does:
4:36 PM
I glad to know that I'm a... variable? I don't Perl :(
Anyone here who's done GCSE Physics? (note the done, not doing)
my @PhiNotPi = ("Test1", "Test2", "Test3");
#my @Doorknob = ("Test1", "Test2", "Test3");
#my @Sp3000 = ("Test1", "Test2", "Test3");
#my @grc = ("Test1", "Test2", "Test3");
#my @FryAmTheEggman = ("Test1", "Test2", "Test3");
#my @MartinBüttner = ("Test1", "Test2", "Test3");
#my @Optimizer = ("Test1", "Test2", "Test3");

my $top_left     = $PhiNotPi[0];
my $bottom_right = $PhiNotPi[2];

print "$_\n" for @PhiNotPi;
That runs.
And this doesn't:
"my" @Doorknob? "my"? I can be whoever I want to be
#my @PhiNotPi = ("Test1", "Test2", "Test3");
#my @Doorknob = ("Test1", "Test2", "Test3");
#my @Sp3000 = ("Test1", "Test2", "Test3");
#my @grc = ("Test1", "Test2", "Test3");
#my @FryAmTheEggman = ("Test1", "Test2", "Test3");
my @MartinBüttner = ("Test1", "Test2", "Test3");
#my @Optimizer = ("Test1", "Test2", "Test3");

my $top_left     = $MartinBüttner[0];
my $bottom_right = $MartinBüttner[2];

print "$_\n" for @MartinBüttner;
@Doorknob Go read the ASCII Collab Club room.
@MartinBüttner I wish OP specified what the first number could be. I think yours breaks if it's 1
4:38 PM
Phi and I discussed this last night.
@Sp3000 hm, you might be right
I'm about to get on a plane for Thanksgiving; I'll check when I get there.
Nice Thanksgiving!
@BetaDecay well, not actually GCSE, but I do study physics. why?
@MartinB├╝ttner I was wondering if I would get marked down in the exam for using fulcrum instead of pivot as it says in the textbook.
4:40 PM
I see... can't tell you, sorry
You dare use slightly different terminology? Expelled.
Also @MartinBüttner one of the Python solutions assumes the input is comma-separated. Did OP specify that? I assumed it was space
@Sp3000 don't know
no he didn't
Hm... well left a comment
@MartinBüttner You are an uncooperative variable.
I figured out why it wasn't running.
4:44 PM
(if it was comma separated I'd tie with Prolog :/)
Unicode ftw!
It was that fancy "u" in your name.
@Sp3000 fixed mine
I think you mean 51 not 71
4:46 PM
I like how it doesn't print permutations of the same thing :D
I thought that was a requirement (it also significantly reduces runtime)
Well that's also not specified, and if it was then my solution would be invalid :/
(as would a few others)
@BetaDecay No. The examiner cares about whether you know physics, not whether you can parrot a textbook. And doesn't know which textbook you used.
Wow we're bombarding OP with questions
Well just in case I posted a no-permutation solution (it's a lot faster)
I don't want to be someone's variable
5:04 PM
@Optimizer Would you rather be someone's constant?
Someone's literal?
5:18 PM
@MartinBüttner lol I blew the stack with 1 1000. What on earth are you doing
that's odd
apparently CJam can't map onto an array of size 1M
Ah k...
@Optimizer how do you map a block that you saved in a variable?
you can't do F% because F immediately runs block. and you can't do :F because that sets F.
only {F}%?
That's how you do it in GS
5:39 PM
Aww I tried 3 9.899494936611667 and it still blew the stack
@Optimizer It was just for fun - I'm not really using this code.
I learned that pings worked in code formatting, and I just got the idea to do it.
5:54 PM
@MartinBüttner - you missed keyword
6:07 PM
@MartinBüttner I did not get your question of map ...
oh, now I get it, yeah, {F} only, as you did not save the block, but the contents of the block
{{2*}}:F;1 3 5 8 10]F% works
because I saved a block in the variable F
yeah, fair enough...
5 hours later…
10:57 PM
There's now been 150 edits to unscramble the source code...
11:31 PM
@hsl that's why I want to write stack snippet before posting my c'n'r challenge ;)

« first day (1397 days earlier)      last day (1949 days later) »