« first day (1767 days earlier)      last day (2122 days later) » 

12:00 AM
I have MIME problems on chrome from githubusercontent. Is there an alternative source I can use?
 
I will not abuse this power to accidentally solicit rep (unless I'm already at 175 rep for the day :P )
 
@Mego: Please include a full list from n=0 to n=60 in your question.
 
^
 
12:07 AM
|
tree
 

Christmas tree!

5 mins ago, 3 minutes total – 5 messages, 3 users, 0 stars

Bookmarked 5 secs ago by TanMath

 
@CᴏɴᴏʀO'Bʀɪᴇɴ we made a christmas tree!
 
I saw, but it's own chat room...?
 
12:10 AM
@Mego You can get one from the numerators and denominators of the Bernoulli numbers here oeis.org/A027641/b027641.txt and here oeis.org/A027642/b027642.txt, though please note that the first link is the numerators for the first Bernoulli numbers, as the OEIS for the second Bernoulli numbers only goes up to n=40
 

Test

4 mins ago, 1 minute total – 3 messages, 3 users, 0 stars

Bookmarked 2 mins ago by Calvin's Hobbies

 
Click room -> create new bookmark to make one
Darn, conversations can only be 400 messages. I tried selecting all 393106 since the first day this chat opened
 
@Calvin'sHobbies Where is room?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Upper right, room▼.
 
12:21 AM
Oic

Because IEEE

53 mins ago, 40 seconds total – 3 messages, 2 users, 0 stars

Bookmarked 7 secs ago by Cᴏɴᴏʀ O'Bʀɪᴇɴ

 
@AlexA. Are you wrong today?
 
I feel like this is a trick question
 
Just answer
 
false
 

Proof of wrongity

1 min ago, 1 minute total – 4 messages, 2 users, 0 stars

Bookmarked 9 secs ago by Calvin's Hobbies

 
12:26 AM

It must be true

2 hours ago, 1 second total – 2 messages, 2 users, 0 stars

Bookmarked 8 secs ago by Cᴏɴᴏʀ O'Bʀɪᴇɴ

 

Alex is wrong

1 min ago, 46 seconds total – 2 messages, 2 users, 0 stars

Bookmarked 12 secs ago by Calvin's Hobbies

 
@Calvin'sHobbies Nested bookmarks!
Didn't know that was possible!
Well, I mean, that makes sense...
Just never considered it.
 
@AlexA. I'm sorry :N
 
:P
Are you though?
@Mego Hello I need you
 
I feel so wrong
(function(N){var x=window[N];delete window[N];window[N]=function(num){return Array.isArray(num)?x(num.join("")):x(num);}})("Number");
 
12:30 AM
Sorry @SE for wasting their bandwidth
 
I modified the Number object ;-;
 
0
Q: Is it a factor of a polynomial?

intboolstringA polynomial is divisible by a factor (x-n) if f(n)=0 for a function f. Your job: to determine if a polynomial function f(x) is divisible by (x-n). The input The input is in the form of (x-n), (Polynomial). Remember, if n is negative, (x-n) will be in the input form of (x+n). For the polyn...

 
12:32 AM
@AlexA. @Mego and @quartata have disappeared at the same time. They must be the same robot.
 
I knew it
quartater tots actually left though. Mego is still in here.
 
Ozj factorial in Jolf :D
 
0M in Minkolang. :P
 
! in APL
 
12:38 AM
Pops n from the stack and pushes n!.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Like yours is clearer... :P
 
Oh.
I meant, without builtins.
@Calvin'sHobbies Right :P
@El'endiaStarman Can you do factorial without M?
 
Okay, assuming n is the only number on the stack: d[i]rx$*
Or [i1+]$*
That's shorter, actually. Haha.
 
Cool!
How about n from input?
 
n[i1+]$*
 
12:40 AM
Oh :P
 
APL still wins, even without builtins: ×/⍳
 
If there's other stuff on the stack, this will work: 1n[i1+*]
 
APL is best PL.
 
12:42 AM
Is code.stypi.com down for anyone else?
 
How does yours work?
I think mine's kinda obvious...
 
fixed:
1
A: Bernoulli Numbers

TanMathPython, 184 bytes This is based on Mego's example implementation, except golfed further. import math def n(n,r):f=math.factorial;return f(n)/f(r)/f(n-r) def B(m): if m==0:return 1 if m%2!=0 and m!=1:return 0 t=0 for k in range(0,m):t+=n(m, k)*B(k)/(m-k+1.0) return 1-t Try it online.

 
Ozj
  j take input
 z  create a range [1..j] (inclusive)
O   take product
        implicit output
 
12:43 AM
@Calvin'sHobbies yep it is
 
@CᴏɴᴏʀO'Bʀɪᴇɴ No https
 
@AlexA. whoops
 
[smacks forehead]
1nL$* is the shortest in Minkolang.
 
@El'endiaStarman Forgot a command? :3
 
Tack an N on the end for output.
Yeah... >_>
 
12:45 AM
I hate when that happens >_<
Esp. when someone else uses it
 
Incidentally, nLrx$* (or equivalently nL$x$*) also works because the top of stack is 0 when the stack is empty. :P
 
@Mego The accuracy criteria on your Bernoulli question could be done better.
 
That was really weird.
 
And fun. But yes, weird too.
 
1:03 AM
Who keeps making butt jokes ._.
 
@Calvin'sHobbies Obviously not me...
 
Obviously :P
 
there's someone impersonating you @CᴏɴᴏʀO'Bʀɪᴇɴ
 
nvm he left
who the f- was that?
 
1:19 AM
It's too bad they aren't in here. You can get suspended on SE for impersonating another user.
 
Are you @Cᴏɴᴏʀ^2?
 
great.
 
Conor^2?
What is that?
 
1:19 AM
prolly the original fake conor
 
> original fake
.__.
 
That guy pi$$es me off
 
so he is on chat right now
 
^
:O
It's @AlexA.
 
Well, the chat and its transcript are public
@Seadrus No
 
1:21 AM
xD
 
But it's probably someone in here
 
he left again
@AlexA. it has to be
 
who just left chat right now?
 
idk?
 
1:22 AM
okay...
say your username if you are in the piratepad?
 
Maltysen
 
bc the conor impersonator keeps on coming
 
There's only 3
 
TheSideVoter
 
@Mego Your picture reminds me of this person ^
 
1:24 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ you can come back now
 
Did he leave?
It says he's still here
 
In piratepad.net/71hUfqmXzj? I should'na made 2
 
> should'na
??
 
should'na.
(should not have)
 
Oh okay
 
1:28 AM
@Calvin'sHobbies They can go to either one, it doesn't matter.
Also I thought the xs would be necessary for a setup like this:
 #
 #
 #
 #
# x
#
#
#
 x
But maybe not.
It would make parsing it easier, IMO.
 
Oh, the lines can end at different points?
I missed that
 
@Calvin'sHobbies Yeah.
I don't have any examples with that though.
I should probably add one.
Anyways, I'll change the empty spaces to .s
0
A: Sandbox for Proposed Challenges

J AtkinStackyMath (TBD, most likely code-golf or code-challenge) Time for you to implement my new stack based language! It's called StackyMath (as if you didn't already know :). This will be a stack based language with 7 operations on the stack and ways to add numbers to the stack. List of operations...

Isn't this a dupe of the RPN challenge
 
Probably
 
Oh, I just realized that replacing the spaces with the dots is going to be a pain.
Bleh
 
s/ /\.
 
1:32 AM
@AlexA. It isn't that simple.
 
Nothing is...
 
Cheese is
 
Cheese is gross
I realize this is probably not a popular opinion
 
Uh-oh, something's wrong with the Webfaction server and/or my code on there.
I can't 'set code' anything.
 
What is Webfaction?
 
1:35 AM
It's a shared hosting company that I use to host starmaninnovations.com.
 
@Calvin'sHobbies Emmental is very complex.
 
@El'endiaStarman the site looks up to me
 
@Maltysen Try this.
What the heck.
It went to the old version.
Okay, restarted Apache and looks like it's fine now.
[tests code that caused the problem, but with smaller values]
.....OH. That was the problem. The numbers were getting too large.
Well, shoot.
 
you should put a time limit on the interpreter otherwise automatically close it and error
 
I have to figure out how to guard against that or that's basically a security problem. One person can make the server totally unresponsive to everyone else.
@Maltysen There is a time limit. 60 seconds.
 
1:42 AM
then what happened?
 
The same thing that would probably happen if you tried to calculate 2**1000000.
 
@El'endiaStarman span a micro vm somehow
 
but won't it shut itself down in 60 secs?
 
@Maltysen I have a .join(60) on the process, but I think the problem is that Python is gobbling cycles, or something like that.
 
is there a way to limit the resources you give to it?
 
1:43 AM
Not that I know of.
 
0
A: Sandbox for Proposed Challenges

J AtkinStackyMath (TBD, most likely code-golf or code-challenge) Time for you to implement my new stack based language! It's called StackyMath (as if you didn't already know :). This will be a stack based language with 7 operations on the stack and ways to add numbers to the stack. List of operations...

 
are you using the subprocess module?
 
multiprocessing, yes.
 
Hey @Doorknob
 
1:45 AM
idk about multiprocessing, but subprocess module has timeout param
 
Does this Ruby code:
print [*'A'..'Z',*'0'..'9'].repeated_permutation(4).to_a;
 
Did we find out who was impersonating me?
 
Work for this:
0
Q: Guess my password! (Code Golf)

Ashwin GuptaSo, like the title says, today you are going to guess my password (sort of). You need to make a big long list of every possible password I might be using on my 4 digit online vault. Specifications: It could contain any 26 letters of the alphabet in UPPER CASE. It could contain any numbers 0-9...

(And yes I know it isn't well golfed yet)
 
0
Q: Guess my password! (Code Golf)

Ashwin GuptaSo, like the title says, today you are going to guess my password (sort of). You need to make a big long list of every possible password I might be using on my 4 digit online vault. Specifications: It could contain any 26 letters of the alphabet in UPPER CASE. It could contain any numbers 0-9...

 
god damn @Maltysen
Whatever
YOLO
0
A: Guess my password! (Code Golf)

quartataRuby, 64 bytes [*'A'..'Z',*'0'..'9'].repeated_permutation(4){|a|puts a.inspect} Probably golfable further, I'm not that good at Ruby.

 
1:50 AM
@NewMainPosts dupe
 
Looks like it works which is good enough for me
 
With the same framing, even.
 
@feersum It's not really exactly the same.
 
It does not have to be exactly the same to be a dupe.
If we stopped at "passworb" instead of "password" for example, it would still be a duplicate.
 
If answers can be copied with minimal or trivial changes, it's a d00p.
 
1:53 AM
Well, it was fun while it lasted.
@Doorknob did I do the Ruby right
 
@quartata huh?
 
@Maltysen You beat me to answering it :P
 
@quartata wat
 
0
A: Guess my password! (Code Golf)

quartataRuby, 64 bytes [*'A'..'Z',*'0'..'9'].repeated_permutation(4){|a|puts a.inspect} Probably golfable further, I'm not that good at Ruby.

My first time actually trying to golf in Ruby
I just remembered it had repeated_permutation
 
Ruby has base 36 conversion, doesn't it?
 
1:55 AM
@feersum yes
but upcase is long
 
It would probably be way shorter to go over a range and base convert
@Doorknob If upcase is long then what is repeated_permutation?
 
@quartata isn't that technically against the rules? //no premade tools
 
@feersum fair point :P
somelongnumber.times.map{|x|x.to_s(36).upcase.rjust 4,?0}
not sure if that works or not
yeah it should
somelongnumber is 'ZZZZ'.to_i(36) which is 1679615
btw @quartata p x == puts x.inspect
 
@Doorknob Oh.
I didn't know that.
Outgolfed by Haskell.
I'm just going to sit over here and cry
 
Weird, my python solution for the bernkulli challenge is the shortest, yet only one person liked mine..oh well
 
1:59 AM
> marked as duplicate by feersum, Alex A.♦ 7 mins ago
>
answered 3 mins ago
 

« first day (1767 days earlier)      last day (2122 days later) »