« first day (2379 days earlier)      last day (2463 days later) » 

2:00 AM
@MDXF Maybe because people need to sleep?
 
@ppperry "not entirely correct" = "valid"?
@ASCII-only Name one programmer that sleeps 13 hours
 
this is getting ridiculous!
 
@MDXF Name one person that spends their entire time awake on SO (i.e. during school/work/whatever as well)
 
>_>
all people were thinking is
the sequence is really hard
 
2:01 AM
I don't believe people use SO, Questions just show up and get answered by a highly trained bot.
 
made by jon skeet ofc
 
@totallyhuman nah it isn't it was just super confusing
@totallyhuman *Dennis
jon skeet doesn't make bots :P
 
@ASCII-only Fine. HyperNeutrino commented on that answer four hours ago. Has another answer been posted to that OEIS challenge?
So HyperNeutrino was awake and on PPCG four hours ago
 
@ASCII-only interchangeably that i what i meant yeah
 
Guys. I'm not trying to make an argument. I'm just baffled by why the bytecount has to be 236, especially when there are three arbitrary spaces in the code!
 
2:03 AM
it just seems to be impossible to compute
but it's not
that has been proven
yay smart people
 
@MDXF because it came out to 236 bytes by chance.
 
@ppperry Not by chance. By three unnecessary spaces in the third (or was it the fourth?) line
 
no
 
Then why is the third (or fourth) line indented so strangely?
 
I did not add those spaces to make it a hard sequence
 
2:05 AM
Yes I know but they don't need to be there
Oh it's way more than three
    (dotimes (count n result)
             (setf result (* m result)))))
 
Because they were indented strangely on the StackOverflow answer I copied code (with proper attribution) from.
 
That doesn't make it less unnecessary....
 
-1
Q: Lisp Sum of power

kirkharamilerDefine a function "power" that takes two input arguments m and n, and returns m^n. Then, by using the function "power", define a function sum_power that takes two input arguments m and n and returns the sum: (1^n + 2^n + 3^n +.... + m^n). int first function i calculate power from given arguments...

edit that question if you think it's formatted poorly
I still won't change my bytecount, though
 
@MDXF why not make it tidy
 
@ASCII-only I tried
It got rolled back like three times
 
2:07 AM
This is not a code find
 
For ... no reason
 
I rolled it back because I see no reason why you have the right to change my code.
 
To make the next sequence not take three days for mathematicians to compute?
Or something like that?
Maybe?
 
I was going to quote HyperNeutrino's comment about this, but it was deleted ...
 
@MDXF is there anything wrong with that?
2
 
2:09 AM
A mod nuked a few comments after I flagged it. But IIRC, caird (who we can't really ask) ruled that you can't change bytecounts randomly, unless your answer was completely incorrect, and Peter and Leaky both expressed similar opinions.
 
@ASCII-only Yes. The difficulty of the next answer is artificial. The only reason it is so hard is because of incorrect lisp formatting
 
@MDXF The challenge has almost died three times by now lol
 
So now you have to check the next sequence is ready to compute now and pad with spaces?
@MDXF and what do you know about lisp formatting
 
@ASCII-only Um.
 
parens
 
2:10 AM
What makes you think I don't know about lisp formatting?
 
lots of them
 
@MDXF The only reason it is so hard is because I didn't arbitrarily reformat code I copied from StackOverflow
 
that's about all i know
 
@MDXF well do you know lisp
 
@ppperry arbitrarily?
You mean properly format?
 
2:10 AM
there was no need to
lisp is a whitespace-ignorant language
 
There is no need to properly format code. *sighs*
 
the code works just fine
 
@MDXF this is PPCG not CR we don't follow conventions here
5
 
@ASCII-only I've read the O'Reilly book on it
Oh FFS this is stupid
 
Also, I think I found a visual glitch.
On the question, caird shows up with one rep and no badges
 
2:12 AM
I've added support for ++, +=, --, -= in MaybeLater
 
but his userpage shows 1 gold badge, 12 silver badges, and 44 bronze ones.
 
because he's suspended
 
still, it's an inconsistency
 
that's how suspended users are displayed
 
but why does it show the badges on the userpage, then
 
2:13 AM
eh maybe
 
@MDXF so the way in the O'Reilly book is the only acceptable way?
 
i think that when somebody wants to look specifically, they can find out
 
Why don't you just edit the code on the StackOverflow question if you think it has excess indentation
 
@ppperry idk, probably resetting rep is a good enough indication of suspension
Also it's not as easy to hide badges
 
@ASCII-only But the badges are hidden on the question
 
2:16 AM
@ppperry oh ok huh
 
this is off-topic
 
Also guys please don't publicly discuss suspensions. Thank you very much :)
 
I wasn't.
I was discussion visual glitches associated with suspensions.
 
Itsafeaturethough
 
Just a reminder for those who might not have known.
ಠ_ಠ the paper for the OEIS sequence won't load so I can't read it
The CMS one isn't loading but the AMS one works :D
 
2:19 AM
@MDXF if there's anything you should complain about it's the 1 byte solution because sequence 1 was so hard it had to be hardcoded
@HyperNeutrino which one
 
@ASCII-only Er, can I claim inconsistent enforcement of the rules?
 
nope
 
Or was that sequence not just hard, but noncomputable
 
@ppperry ???
 
2:20 AM
rules allow it
 
@ppperry no it's just really complex
 
hardcoding till a 1000 i think
 
You can hardcode the first 1000 values.
 
@HyperNeutrino ninja'd
 
But there aren't 1000 values yet for this sequence
@totallyhuman >.<
 
2:21 AM
Is that n=1000 or f(n)=1000..?
 
$0\leq n = 1000$
 
n=1000
 
Because we physically do not know $f(1000)$ in this case.
 
why did there have to be three answers
 
2:21 AM
@HyperNeutrino don't try to out do my latex >_>
 
@ATaco A236? Yeah which is why we couldn't hardcode it
 
The first 1000 values doesn't include $f(1000)$ because it's 0-indexed
 
Oh ok
 
arrrgh
i messed it up
stupid edit time limits
 
...
 
2:24 AM
anyway brb in a bit I'm going to re-read through the entire email
 
@totallyhuman wait is leq even a thing
 
good news; you still have a few more days
 
@ASCII-only yes
 
and Taxi is a great language to win!
 
$0 \leq n < 1000$
final answer
:P
 
2:25 AM
nope
didn't work
 
what didn't work?
 
the math formatting
 
oh you need a userscript for that
it's not built-in
 
This code is hard to read. You need to format it. — Rainer Joswig Apr 14 '15 at 18:48
 
2:27 AM
no. HyperNeutrino's math renders fine for me
 
I used the userscript to generate the image.
 
oh
 
totallyhuman puts the code which relies on the userscript on your side to render the MathJax
 
@everyone if you could choose a SE link shortener domain what would it be
 
Mine can't inline and it's a lot bigger but it doesn't rely on you having userscripts
 
2:28 AM
s.tk
one already exists
117
Q: What shortened URLs are available through s.tk?

Jeremy BanksIt was announced on the Stack Exchange Podcast episode #23 (at 1:05:26) that Stack Exchange has its own URL shortener, http://s.tk/. Users can't create their own, they can only use the ones that are built-in. What shortened URLs are available through it? Return to FAQ index

 
@ppperry eh it's too long
 
er, no...
 
yay our URL is decently golfed
instead of s.tk/codegolf as in codegolf.stackexchange.com, it's s.tk/golf :D
s.tk/pcg would be better though
wtf?
it literally got posted, downvoted once, and deleted within a minute
 
probably some error in the spec that the user deleted to fix
 
it was sandboxed though, why not fix it in sandbox?
probably didn't get any review though :I
 
2:33 AM
erm a new post was posted and then immediately deleted
 
@totallyhuman you appear to have missed what I just said? xD
 
@ppperry not the domain, the paths
 
@HyperNeutrino oh >_<
 
is nine characters too long
 
do we have a prime number base challenge?
 
2:34 AM
idk
 
From man which: --help: Print usage information on standard output then exit successfully.
From which --help: .code.tio:which:1: bad option: -h
 
Yay, My Userscripts
 
> The sequence of primes, along with 1, is a complete sequence; any positive integer can be written as a sum of primes (and 1) using each at most once.
 
0
Q: Thirty-one Oddities

Jonathan FrechProlog In the very fun and well-known card Thirty-one, each player holds three cards from a French deck (the Wikipedia article suggests a deck containing 52 cards, I, however, play it with 32). The game is played in successive rounds, with each player having a number of lives which decreases whi...

 
@Pavel Did you namechange or have you just been away from chat for a long time?
 
2:35 AM
@ATaco $yes$
 
meaning you could use binary to show which prime numbers are used in the sum to represent any number
 
@HyperNeutrino I'm Phoenix
 
Thought so
 
@ppperry also I'm looking for the shortest question/answer path shortener
 
i just solved the stupid lol challenge
pls undelete pls
 
2:36 AM
PPCG free domains are taken :(
Idk if I should use something else like cgolf or something
 
would it be inappropriate to vote to undelete it?
 
yeah this seems like a good challenge... it could even be a good challenge with fibonacci numbers instead of primes
 
Actually I can use ppcg.me
 
I can set up ppcg.a-ta.co
 
That would be great
 
2:41 AM
@totallyhuman Typically it is discouraged to undelete questions that were deleted by OP, especially if they have downvotes.
 
ppcg.ga already exists
is self-deletion the only time when a question can be deleted but not closed?
 
aw :c
 
I can't access s.tk/golf. I need the https://
 
i was going to upvote it though
speaking of domains, i should check if any of mine need renewal...
 
@ppperry yeah but it's DNS level so doesn't support paths
 
Even shorter version of that one sequence: wheni is*i=(printi)+j++i=1
 
@Pavel cQuents, =1:$+z-1, probably golfable
 
@StepHen it's your own language though
 
Hmm would anyone even use a PPCG link shortener
 
@totallyhuman I mean I could golf it if I was more awake
since no one knows it
@totallyhuman I couldn't figure out how else to not output triangular numbers
 
2:49 AM
i also have observefailure.tk
lol
 
@Pavel Alternately, =1$0:$+z
 
very suitable domain for its current state
 
I've added ppcg.a-ta.co and tnb.a-ta.co TTL is 30 minutes.
 
wish i knew html and stuff better though
 
@totallyhuman html's easy :P
it's the css and javascript that makes it "difficult"
 
2:51 AM
ye but you still need to learn it
also yes css is a PITA
 
<HTML><head><script>/*Generate the webpage here*/</script></head><body></body></HTML>
 
eh not once you've used it enough
@ATaco booo
@ATaco don't forget to use jQuery
 
many a-ta.co sites use <HTML><head><script type="server/js">/*Generate the webpage here*/</script></head><body></body></HTML>
The third highest voted CSS question on SO is how to horizontally center a div.
 
@ATaco I still get screwed by that sometimes, when it doesn't work the way I want it to
no wait
I get screwed by having a left-aligned div and a right-aligned div in the same row
 
CSS is sadness.
It's a fact
 
2:57 AM
I love the flexibility of working with the DOM with jQuery/CSS selectors
I hate the separation of HTML and CSS for when I want stuff to just work
 
Dom is great, Everything else sucks.
JQuery sucks too, but I still love it.
 
i should probably just use some template
 
@totallyhuman why, it's not that hard to style a site
Add a header and a footer, a different color from the background
 
then add a div in the middle
 
2:58 AM
meh i like doing python code more than doing html
 
django or something i presume
still meh
 
 
> Where are my legs?
can relate 10/10
!google portfolio website template
argh wrong chatroom
 
ppcg.a-ta.co is now live. Enjoy that shortcut
 
3:03 AM
'bib', 'bob', 'bub'
"lol" variants
 
'kek'
 
@ppperry um, exactly?
 
'kak', 'kek', 'kik'
 
'queq'
 
that's 4 letters :P
 
3:04 AM
0
A: Sandbox for Proposed Challenges

Destructible LemonPrime encode integers! In this challenge, you must convert inputted integers into a prime encoding. The sequence of the primes, and 1, is a complete sequence (We're going to consider 1 an honourary prime for this challenge). What this means is that it's possible to express any positive integer ...

 
We sacrifice brevity for clarity
 
@DestructibleLemon wait for NSP 0/10
 
@ATaco Oh wait this isn't CodeReview
 
but nsp is slow
 
'qaq', 'qeq', 'qiq'
'dad', 'ded', 'did'
 
3:09 AM
Oh and all my messages when ppperry was in this room 'cause I can't stay level-headed
 
XD
 
I made a sequel to that that I submitted to sromg
do you want an early viewing of it?
 
hmmmm... I am considering whether this is a good idea...
 
3:12 AM
c.o.n.s.i.d.e.r.a.t.i.o.n. is a good thing
i still think monospace is pleasing enough to be the norm
brb adding a stylish theme to change every font to monospace
 
$(document.body).append($("<style>.message{font-family:monospace;}</style>"))
 
@ATaco It renders fine in TNB, but you know how if you're in a room it shows the last message in other rooms you're in? It renders as chatjax there, please fix.
 
0
A: Sandbox for Proposed Challenges

Destructible LemonPrime encode integers! In this challenge, you must convert inputted integers into a prime encoding. The sequence of the primes, and 1, is a complete sequence (We're going to consider 1 an honourary prime for this challenge). What this means is that it's possible to express any positive integer ...

 
@Pavel Nah
 
@ATaco 0/10 doesn't shorten :P
@ATaco is that banb upside down
 
3:20 AM
qauueq is now rather important to me.
 
@MDXF If you're ok waiting a little over an hour :P
Phones are stupid
 
should I do it @DJMcMayhem?
 
$(document.body).append($("<style>.message{font-family:Brush Script MT;}</style>"))
 
I got some of it @MDXF
 
@Riker Thanks
 
3:30 AM
This font is absolutely unreadable
I love it
 
It's lovely, but how do you make the size bigger?
I am CSS noob
 
font-size: 18pt
I don't recommend it, it makes everything bigger.
 
It does, but at least it's readable now.
 
arguably.
 
It's prolly smaller by default on my screen than yours
Mine's 1440p
 
3:34 AM
No, it's very much so unreadable before, too.
 
Well, it's readable to me now.
And it wasn't before.
 
I suppose I am reading it.
Just not very easily.
 
@ATaco ay sounds like dyslexics
Where's that biweekly contest for undervoted answers?
Also, can we have a contest for overvoted answers that deserve downvotes (in exchange for upvotes on better ones) or something like that?
 
3:53 AM
@MDXF A certain answer relating to segfaults comes to mind.
 
@Pavel Two now actually >.<
They're both my top voted answers :(
I mean I enjoy the meme but other than that it's really annoying
(It's also funny because right now I have no f*cking idea why my interpreter is seg-faulting)
On a completely unrelated note, does anyone have a C compiler handy and nothing to do?
 
@MDXF dennis has a TIO handy :P
 
I doubt Dennis ever has nothing to do
He's got at least fifty challenges he can pwn at all times
 
Topic: Interesting computer customisations.
I have 10 clipboards.
 
HOW
 
4:06 AM
Autohotkey
It's incredibly useful.
Although I'm only really using at most 5 at a time.
 
Ah
Topic: Computer pet peeves
When people call AutoHotkey AHK
 
But it is AHK
 
no AHK is the file extension
 
Literally the front page of the site.
 
A uto H ot K ey
 
4:10 AM
@ATaco I have large amounts of tape on my laptop lid because the hinge is completey busted :(
 
Meh
Hey, the C file extension is on the front page of everything referring to C ever :P
 
is anyone good at phsyics
 
Not according to my ATAR
 
I wish I was good at physics
And math
 
@Tobi are you asking for ur brownian motion?
 
4:21 AM
the brownian motion thing was just a jk lmfao
 
Btw, does anyone know if the site-specific mod chatrooms are special, or are they just typical gallery chatrooms?
 
Im asking for the program
 
Ah yes, the physical property of penguins bouncing off icebergs.
2
 
@ATaco Ok I just opened this tab and saw that
That's great
No context needed
 
Physics.
 
Anonymous
4:24 AM
@MDXF They're private rooms - only mods and users with explicit access can even see them. Also non-mods can't be added as ROs - the system purges them every so often.
 
@Mego Oh okay, thanks
In what case would a non-mod be given access to a private mod room?
 
Anonymous
@MDXF A mod needing to communicate privately with a user about moderation stuff is the typical use case.
 
Hmm, wouldn't it be wiser to just create a new room, such as Discussion between <normal user> and <mod>?
So that the normal user wouldn't have access to the mod room's history?
 
Anonymous
@MDXF They do create a new room, but they make it private because PII is usually involved.
 
Anonymous
Mods have the ability to create new private rooms
 
4:27 AM
Ohh okay, got it
 
@Tobi yeah that's what i meant
what's ur question?
 
Im trying to calc bounce of two colliding circles
before, I was treating all collisions as head on
i want to take into account angle of collision
 
@Maltysen whoa you're pretty high-rep, how come I've never noticed you
 
@MDXF i haven't been that active lately, summer research project
also, hi
 
Ah
Hi :P
 
4:34 AM
@Tobi these are elastic?
 
yh
 
I'm new, I became active three or four months ago
 
i think u can use conservation of momemtum
seperate velocity into component vectors
get momentum component vectors
 
thats what im doing
but im stuck
 
add them up
@Tobi well v=<cos(theta)*|v|, sin(theta)*|v|>
 
4:35 AM
I split the velocitty into the components
 
and p=mv
u do for both
 
paralel to collision and perp
 
p=p1+p2
@Tobi doesn't matter as long as its same refernce frame for both
then new p1 p2 = p/2
and then v1=p1/m1 v2=p2/m2
@Tobi why not stick with global x y basis?
@Tobi u following?
 
0
Q: please help me to understand this type of question ,what am i do?

Ajit kumaryou will be given 3 integers as input.The input may or may not be different from each other. you have to output 1 if all three inputs are different from each other, and 0 if any input is repeated more than once.

 

« first day (2379 days earlier)      last day (2463 days later) »