« first day (2194 days earlier)      last day (2648 days later) » 
00:00 - 18:0018:00 - 00:00

6:12 PM
It amazes me how far this challenge has come
 
HOW DID THEY FIT C++ IN THERE
HOW IS THAT VALID
 
I have no clue
 
TIO's cache is really helpful when running all the programs in the polyglot
 
It has a score of about 0.01532 if it was submitted here
Not the best, but by far the most languages
 
So much yes
 
6:16 PM
I had participated in the beginning, but now its just too time consuming
I guess it's partly my fault for posting hexagony
I feel like its kinda like playing jenga, where you have to push pieces in instead of pulling them out without it all toppling over
 
And one of the pieces is a hexagon for no reason
 
My latest submission to the polyglot was post #15. Soon there were some very difficult languages *cough*Hexagony*cough* that I just gave up
 
I'm just amazed that C++ compiles
 
@KritixiLithos Yeeeeaaaaaah. sorry about that :)
Welp, time to work on a cubix solution! ;P /s
 
@KritixiLithos You should clearly try again now that there are languages like incident in there too
 
6:22 PM
Someone, someday, will add malbolge. They will lose for breaking the chain, but showered with bounty awards.
 
Possibly after the challenge has officially ended
 
Hmm.., yeah.
 
SE IS DOWN
PANIC
 
I feel like this challenge is so popular that people will continue to post after there is a winner, just for fun
 
nvm it's back up
 
6:24 PM
@MistahFiggins Most certaintly, yeah.
 
@Riker then you can you write messages 🤔
 
I mean, if I get the time I certainly might
 
TIL Ubuntu has a feature for installing updates without a restart.
 
The last time SE was down chat was working fine...ish
 
This is the best day of my life.
 
6:25 PM
@betseg chat is still up generally
 
the message I got said "down for maintenance", and generally chat stays up for that
 
@Pavel you mean seperate packages or the whole distro update?
 
0
Q: Is this Sequence Graphic?

Möbius Chicken StripA graphic sequence is a sequence of positive integers each denoting the number of edges for a node in a multi-graph. Each integer in the sequence refers to a different node in the graph and no node does not have a corresponding integer. Not all sequences are graphic sequences. For example any s...

0
Q: Alternating Power Fibonacci Sequence

DennisDefinition The Alternating Power Fibonacci Sequence is formed as follows. Start with the empty sequence and set n to 1. Compute fn, the nth unique, non-negative Fibonacci number. 0 is the first, 1 is the second, 2 is the third. All others are obtained by summing the two previous numbers in the...

 
@betseg "critical kernel patches"
 
6:28 PM
It's like that since Linux kernel 4.0
 
@NewMainPosts inb4 5 byte jelly solution
 
@DJMcMayhem probably more like 3
 
@betseg I switched from windows yesterday
 
Ah, I get it now. What I meant to say is that all distros have this feature.
 
fib, multiply by -1, repeat n copies
something like that
idk
 
6:31 PM
That actually sounds like a fun game. Given a new challenge on main, make bets about how long the shortest jelly answer will be
I think this one looks to be around 12-15
 
Or make bets egg? :3
 
lel
 
@DJMcMayhem I'm guessing 1 for fibonacci + 1 negation + 2 for duplication + 1 for returning the result. So 5-9 bytes
 
Inb4 Mathematica has a built-in that's longer than Jelly
 
Maybe by chaining two together, but I don't think so.
 
6:42 PM
What is the general consensus on command line arguments with polyglots? do they have to be the same for all programs?
 
isn't one
 
Should i post on meta?
 
I would
 
sure
 
6:54 PM
What is the tag for in meta?
 
?
the tag on meta?
 
cool needs the hyphen in meta-tag
 
0
Q: Command Line Arguments in Polyglots

Mistah FigginsIt occurs to me that There isn't really a general consensus on how command line arguments should be treated in polyglots. So... What should the consensus on command line arguments in polyglots be? I see 2 main options: The command line arguments should be the same for all of the programs The ...

Any changes to the question that you would make?
 
CALLED It
SE IS DOWN
PANIC
 
6:58 PM
oop. well then
 
I'm still able to browse it though?
 
Meta still works
It all still works?
 
t's back
 
Enough panic
 
They should write "Don't Panic" in large, friendly letters on that screen
 
7:03 PM
0
Q: Command Line Arguments in Polyglots

Mistah FigginsIt occurs to me that There isn't really a general consensus on how command line arguments should be treated in polyglots. So... What should the consensus on command line arguments in polyglots be? I see 2 main options: The command line arguments should be the same for all of the programs The ...

 
 
1 hour later…
8:04 PM
1
Q: Should I Fold this Hold'em Hand?

carusocomputingYour friend invited you to a high-stakes poker game at the last minute and, as a computer scientist, you've decided to use your skills to gain an edge on the game. Your task will be, given 2 cards (your hand) and 0, 3, 4 or 5 cards (the dealt cards), you must decide what the best possible hand yo...

 
Anonymous
> This was in the sandbox for 2 weeks and got 3 likes and 1 piece of constructive feedback.
 
Anonymous
It's sad that needs to be said. This is why I quit using the Sandbox.
 
Anonymous
Well, that, and people upvoting a challenge of mine that had a glaring issue
 
@Mego Does that need to be said, though?
 
Anonymous
Possibly not, but I'm not going to edit it out
 
Anonymous
8:09 PM
I'm not going to get in a fight this early :P
 
do we need that text in the new main posts?
i edited it out
er, okay then, consensus is we don't
 
@Mego Fighting? Isn't that all the Interwebs are good for these days? :-/
 
that and playing MMOs
 
Anonymous
Internet! What is it good for? Absolutely nothing Cat GIFs!
 
That's true. Cat GIFs are like the universal bringer-together-er.
(so long as you don't say the term out loud)
 
8:12 PM
Jan 6 at 19:20, by Kritixi Lithos
> The Internet, the villain behind corrupting people’s lives, is destroyed. Is it for the better… or the worse…
 
Anonymous
A friend of mine used to argue with me a ton over the pronunciation. She said "jif", I say "gif". We came to a compromise: "peanut butter"
 
Anonymous
Low quality GIFs are chunky, high-quality ones are creamy
8
 
Same deal with my friend, except that he came to the conclusion that it's "a moving PNG"
 
@DJMcMayhem Do you pronounce that P-N-G or ping?
 
Anonymous
P-N-G
 
Anonymous
8:19 PM
A ping is something else entirely
 
Anonymous
And "pung" sounds dumb
 
Why not [png]? Syllabic ns are a thing
 
I've always said P-N-G, but a coworker says ping.
 
@TuxCopter I'm not sure I approve of a file format name that sounds like I was just punched in the stomach.
 
Nice try, WolframAlpha.
 
8:20 PM
@Riley yes
(the first)
 
@DJMcMayhem MNG or APNG or one of the handful of other extensions are all something totally different.
 
@DJMcMayhem yup, currently 5
 
I've heard peng before
 
o_O
 
Anonymous
@BusinessCat Hi
 
8:26 PM
I didn't know about that. I'll have to give him crap about that
 
@Mego Hello
 
Anonymous
No that was a reference to peng
 
Anonymous
Hello I am penguin
 
Me too o/
 
There's too many penguins and cats in here.
 
8:27 PM
wot?
never too many cats
 
And never too many penguins
 
You got me there
 
But too little droids ;_;
 
The sith army has a good stock of droids
 
@Mego So if I take a picture and save it for use on the Internet, am I penguin it?
 
Anonymous
8:29 PM
@AdmBorkBork No. That's just silly.
 
Oh. OK.
 
8:39 PM
pingu?
 
.noot
 
noot noot!
 
@Mego What about that episode of MacGyver, where they "bitmap it?"
 
@Downgoat
2545
Q: Proper use cases for Android UserManager.isUserAGoat()?

Ovidiu LatcuI was looking at the new APIs introduced in Android 4.2. While looking at the UserManager class I came across the following method: public boolean isUserAGoat() Used to determine whether the user making this call is subject to teleportations. Returns whether the user making this call...

3
 
wat
8:57 PM
tfw you boot your Arch Linux flash drive on a school computer
and the staff approves of it
 
9:08 PM
I can boot into Ubuntu on my school computer, but I can't install it. Ultimately, not all that useful, considering I can't really do any work.
 
@wat when I was doing that sort of thing, I just brought in my own hdd and replaced it with the built in one. It somehow worked
 
@muddyfish Why would that not work?
 
@Pavel I'm not sure why it wouldn't but I was surprised
different processors?
 
That's not how HDDs work
 
@Pavel I meant booting from it
 
9:12 PM
The only thing that could prevent you from modifying the system was written to the hard drive you just removed.
 
@Pavel different instruction sets.
 
Huh, in my experience HDDs are universally compatible with all computer hardware.
 
@Pavel they are
 
So what's the issue?
 
9:14 PM
I was talking about the os installed on the hdd
 
Oh I get it now.
 
@VoteToClose the lowest I have is at -1
 
The lowest that shows up for me is at 19.
 
@DJMcMayhem you can do [meta-tag:tag-name]
 
It'd be +2 if it counted questions, but noooo.
 
9:18 PM
@VoteToClose if it counted questions, I'd just tag my best questions as some random tag and reap the copper badges
 
@muddyfish But that'd be untagged by some editor quickly. ;)
 
@muddyfish why not just retag the questions where you have good answers? That's much simpler
 
9:39 PM
Well I was just royally screwed
 
wat
@Pavel I actually installed it on the flash drive. I used the "Multiboot USB drive" guide on the Arch Wiki.
 
So my Dad is buying a Miata MX-5 Rf LE
I was going to go pick it up with him and ride back in it
 
wat
I have Linux ISOs in an ext2 partition. I also have a btrfs partition with subvolumes for /arch (arch root), /ubuntu (ubuntu root), and /home (shared home)
 
The school didn't give me the note saying to go to the pick-up line
thanks school. Now I am stuck at home with extra chores to do
 
wat
@ChristopherPeart i feel
 
9:44 PM
I have spent the past hour and thirty min trying not to be pissed
I failed
 
@VoteToClose Was not expecting so thorough a starring. o.o
 
@ChristopherPeart Play ToS, guaranteed to redirect your salt in minutes.
 
Town of Salem
 
9:52 PM
@Pavel or dota
 
That helped a little
Don't even get me started on Dota
I love the game
 
@Riker That takes time and effort
 
But the internet is not working for it
 
Also, I'm not done crying over what happened with Alliance after TI.
 
@ChristopherPeart dota is salt mine confirmed
 
9:53 PM
yep
 
IT WAS GOING SO WELL
Does anyone know the complexity of generating a randint from 0 to n, in JS?
 
super easy
floor(random(0,n));
 
That's not what I meant by complexity.
 
he means like O(n) vs O(n^n) vs O(inf)
i made those last 2 up
 
9:59 PM
Well, I understand how you made the last one up, but I can imagine O(n^n) being a thing.
Probably got someone fired.
 
@Riker O(inf) could actually be a thing tho. Just means that, for all n, it takes infinite time and processing.
 
I can't think of a problem that can only be solved in O(2^n)
 
O(n^n) is definitely a thing :P
 
@ATaco iirc, generating the nth prime.
@VoteToClose Like calculating pi
 
@Pavel I suppose.
 
10:01 PM
I think any O(inf) program doesn't even serve a practical output.
 
Though I suspect you would use another O value - O(f(n)) where n is number of digits calculated.
 
Oh, Fibonacci numbers are O(2^n)
 
I checked CS.SE, everyone says that the complexity of generating the Nth prime is NlogN because you should be doing a lookup in a table. Which is not even remotely helpful.
 
It's kind of helpful
 
I suppose. Wikipedia says O(N*Log(Log(N)), which is far faster than I expected.
 
10:07 PM
CMC: recommend a band/artist for me to listen to right now
 
And I think wrong
@DJMcMayhem MDK
Since doing a lookup in a table is slower than that
 
The Naïve approach to test Primacy is to use for (int i=0; i<sqrt(n); i++), but if you're getting as many primes as possible up to a certain number, you can iterate only over the primes you already know, instead of the for loop.
 
Which is annoying.
 
@Pavel We know that the pi(x) is bounded by cx/log(x) (fora known c). We just Need to compute the primes up to cx/log(x) and count them. (Using a sieve method.)
 
So I went from angry scale 500 /10 to 300 /10
 
10:08 PM
Oh I get it, it's O(N/(Log(Log(N))))
Which seems more reasonable
 
That is a java way of calculating primes. I wrote dat to calculate the primes under 1 trillion
 
maxValue + 1?
 
@Pavel checking it out right now
Ty
 
In mathematics, the sieve of Eratosthenes (Ancient Greek: κόσκινον Ἐρατοσθένους, kóskinon Eratosthénous), one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the multiples of 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test...
That is the method used it works super fast. You should try it
 
Yeah, super fast is O(N/loglogN)
No one wants to answer my post ;-;
 
10:14 PM
@ChristopherPeart it's fast, but that doesn't mean it's efficient. It takes a lot of memory
 
I know it's only been 4 hours, so that's not unusual, but it still feels bad, you know?
f[x_]:=PrimeQ@x. EZ, O(1)
 
ThatsCheating.txt
 
@ATaco I hate to be whiny, but code blocks like that take up my entire screen. Could you post large (more then 5-6 lines) code blocks on gist or paste dump or something similar?
 
More like ThatsNotHowComplexityWorks
 
That's fine DJ, Although it suggests we may need to decrease the preview size.
 
10:16 PM
Well, it's also cause mobile. I'm sure it's slightly better on desktop
 
There needs to be a setting in SE to collapse oneboxes and large code blocks.
 
@DJMcMayhem don't you have infinity memory?
 
Ah, that's much better thank you.
@Pavel That could be a nice userscript
 
Maybe we should @Downgoat onto that. :P
 
10:17 PM
@ChristopherPeart uhmmm, no. I have 8 gigs of memory
 
I'd DL that.
 
Talking about the challange
 
Oh, I didn't realize you were talking about a challenge
 
Which challenge?
The Pyramid Scheme one? That has nothing to do with primes.
 
the prime one
 
10:26 PM
user image
2
 
10:42 PM
:O
Such clever cats. :D
Short look to the future: I'm 2 weeks away from getting the gold "Fanatic" badge.
 
0
A: Sandbox for Proposed Challenges

DopappYou have an n day streak! Write a program that keeps track of the number of consecutive days it has been run. The day resets at midnight (the local time of the computer on which the program is run). If there is a day that the program is not run, the counter is reset to zero. Every time the...

 
@NewSandboxedPosts Considering I was just talking about the fanatic badge, that's quite the coincidence.
It's pronounced like jif
As in jiffy
 
@mbomb007 I agree but we're far in the minority
 
10:58 PM
0
A: Sandbox for Proposed Challenges

Artyercode-golf file-system compression Directory zipper Introduction Directories are really clunky and hard to deal with. You can compress them, but that takes valuable time and CPU cycles. How about a basic directory zipper? Challenge Make a program that when: Case 1 Given the name of a direct...

 
Anonymous
11:14 PM
@mbomb007 Choosy developers make their own image format
 
Choosy developers cry because LWZ compression
 
wat
lwz?
 
Lempel–Ziv–Welch (LZW) is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978. The algorithm is simple to implement, and has the potential for very high throughput in hardware implementations. It is the algorithm of the widely used Unix file compression utility compress, and is used in the GIF image format. == Algorithm == The scenario described by Welch's 1984 paper encodes sequences of 8-bit data as fixed-length 12-bit codes...
 
Nope, that's LZW. wat asked for LWZ.
 
Can't say I've heard of that one
 
wat
11:19 PM
yeah i havent either
 
0
Q: One 1, Two 1's, One 2 Two 1's

P. KtinosChallenge: Create a program that takes input of a positive non-zero integer and outputs the 4 next numbers in the sequence described below Sequence: Every number in this sequence (apart from the first, which is the input) shall be composed of n digits, where n is an even number. If we split th...

 
Woo, SO podcast #100! (Little late to the party but)
 
11:53 PM
I think "podcasts" are stupid (well, mostly the word)
 
@Dennis If you don't mind me asking what was wrong with your graphic sequence answer?
 
@MöbiusChickenStrip It fails for singleton lists and possibly other inputs. Shouldn't be hard to fix, but I didn't have time to look into it yet.
 
What algorithm were you using?
 
Probably just have to insert more zeroes.
The same as you.
 
00:00 - 18:0018:00 - 00:00

« first day (2194 days earlier)      last day (2648 days later) »