« first day (2946 days earlier)      last day (1905 days later) » 

12:17 AM
0
A: Sandbox for Proposed Challenges

KrystosTheOverlordONLY MATH!!! The challenge here is to make a program that can only consist of mathematical operations, but the catch? No booleans nor bitwise. You must use pure mathematical operations to perform boolean operations, the operations like sigma and big Pi are allowed, adding, dividing, multiplying...

 
 
2 hours later…
2:07 AM
@Dennis This appears to be some half-assed 2FA; the OTP they send you actually logs you in. I'm not sure what's weirder though: telling people their password is wrong instead of saying they have to provide an additional OTP for 2FA or the fact that it worked without an OTP in Incognito...
 
 
2 hours later…
3:47 AM
This XKCD comic didn't know that Opportunity wouldn't die.
 
Dang dust storm being all dusty and stuff
 
4:07 AM
TFW the challenge has you take a list of numbers as 2-dimensional blobs of characters, and that's actually the most convenient input format for your language.
 
Is a good feel
 
4:21 AM
Is char the data type pronounced as in character or as in charge?
(BTW did I use grammar correctly with that question above?)
 
I've always pronounced it like the word char, as in burn slightly, so the latter
 
me too, but I wonder what's the general norm....
 
And grammar was fine, though I'd probably write it as "char, the data type, ..."
Now if you really want to start a fight, you ask how to pronounce .gif
 
I don't know whether anybody else does it, but I have always pronounced it as G I F.
(pronouncing every letter separately, I mean)
 
gift - t here
 
 
6 hours later…
10:51 AM
-2
Q: Invert your code

Geza KerecsenyiChallenge Return the full contents of your program, but inverted. How do your invert something? Well, Letters: Take the position of the letter in the alphabet, subtract from 26, and use the letter at that position. Also, change the capitalisation. E.g A becomes z, and p becomes J. Digits: Subt...

 
 
1 hour later…
12:09 PM
Is it possible to search for the latest question in X language?
 
12:23 PM
0
A: Sandbox for Proposed Challenges

Luis felipe De jesus MunozBack to life Lets bring the oldest languages used in the site for good. Challenge Given a number X, output the highest sum of consecutive 1-bits in the binary representation of X. e.g; Given 22, its binary representation is 10110, output 2 Your score is calculated using the following form...

 
 
1 hour later…
1:24 PM
Who here did CCC?
 
1:38 PM
@LuisfelipeDejesusMunoz Unfortunately not, as there isn't any standard or built-in feature to register language used.
@LuisfelipeDejesusMunoz The best you can do (I think) is just searching for the language name and sorting by newest: E.g. for APL
 
 
1 hour later…
2:47 PM
0
Q: Crack the bank account's password!

cefelIntroduction In order to prevent keyloggers from stealing an user's password, a certain bank account system has implemented the following security measure: only certain digits are prompted to be entered each time. For example, say your target’s password is 89097, the system may prompt them to e...

 
 
1 hour later…
3:50 PM
0
Q: Fizzbuzz in any base

Geza KerecsenyiChallenge Input: A whole number between 2 and 62 (inclusive). We'll call that number \$b\$. Output: Count to the equivalent of \$100^{10}\$ in base \$b\$. However, if the number is divisible by \$\lfloor b÷2\rfloor\$ (e.g base 10 would be 10/2=5, 5+1=6; if the result is a decimal then subtract ...

 
4:17 PM
in case anyone hasn't tried it
 
I'm going to have to remember this trick the next time I'm over on PCG Stackexchange.Michael Seifert 3 hours ago
(regarding self-reference in mathematica's pure functions #0)
 
 
2 hours later…
6:25 PM
0
A: Sandbox for Proposed Challenges

BeefsterZip, Zap, Zop code-golf string There's a little improv warm up game where you arrange yourself in a circle and send zips, zaps, and zops around by pointing to a person and saying the next word in the sequence, then they do the same until all of you are warmed up or whatever. Your task is to ...

 
Every time I see a post like What's the answer? Genius only! 3-3x6+2=??? I promise myself I won't look at the comments. Every time I do. Then I weep for humanity.
 
@AdmBorkBork its 0 duhhhh
or maybe 2 idk which
 
-13
PEMDAS
 
Maybe I should have added an "/s"
 
Kevin's sandbox post is what reminded me.
No /s for you!
 
6:41 PM
@AdmBorkBork I'm a bit late, but grazi on Socratic
 
Thanks!
 
@DJMcMayhem How (un)common are paprika chips for you?
And smoked or dried meat?
(or for anyone else outside of yurob)
 
@flawr Extremely uncommon. I've never even heard of them before
Smoked or dried meat is not super common, but not exactly uncommon either. Mostly jerky
 
I overheard a foreigner on my commute talking about these two things:)
So here salted and paprika chips are the two most common flavours and probably also the ones that people like most.
 
I don't have it very often, but I really like smoked salmon.
 
6:54 PM
ah right:)
 
Oooh, what's that?
 
"Bündnerfleisch"
 
It looks kinda like prosciutto
 
It is a swiss thing I think, dried meat that was soaked in a wine, onion and other stuff mix.
@DJMcMayhem yes it is similar, I think for prosciutto you mainly use salt
 
Is that something you'd eat frequently, or is it more fancy?
 
7:00 PM
It depends a little bit on the quality, you can find really expensive ones, but I do get some quite regularly
you know, I usually eat it on bread or sandwiches
why is sandwiches such a hard word :/
only got it right after the third attempt :D
 
I guess for sandwiches, smoked meat is somewhat common. Pre-packaged deli meat is pretty much how homemade sandwiches tend to be made, and a lot of that is smoked to cure it before packaging.
 
Yep, I do often get prepackaged deli meat
but when you can cut it yourself it tastes twice as good :)
But unfortunately it usually results in you eating the whole thing at once:)
I was just about talk about Salamitaktik when I looked it up and realized that it exists in many other languages too!!
How cool is that:)
 
I've never heard of paprika chips. Are we talking US chips (crisps) or UK chips (French fries)?
 
crisps:)
 
Sound tasty enough, but I don't really like chips that much anyway.
 
7:15 PM
Do you generally dislike salty food or just chips in particular?
 
Most salty foods are OK, and I'll eat chips every now and then, but not to the extent that some of my friends do.
 
7:31 PM
0
Q: Error-detecting Self-repairing Program

BeefsterYour task is to create a program where if any one character is changed, it will detect which character was changed and then correct the changed character in its own source file. For instance, if your program is RadiationHardened and it is modified to Radia7ionHardened, then your program must out...

 
what are some use cases for finding the Maximum Path Sum of a Binary Tree
Better yet, what property does the Maximum path Sum tell us about the Binary Tree.
 
7:54 PM
is there a reason you're asking?
I imagine you could compute the worst case evaluation cost of a decision tree
 
trying to understand the problem better, by trying understanding what it solves and what property of the Binary tree it is taking advantage of. That sounds reasonable. So it is basically telling us the worst case short of visiting all the nodes
the only analogy I could think of was looking for the most successful gene/trait in a population that descends from a root ancestor
since the solution is a bottom-up optimization problem
 
I mean it is usually rare that you have a "bare" binary tree in some kind of application, usually you do have a lot more structure.
 
It's not sorted in any way?
 
8:10 PM
@PhiNotPi you mean the BST, by definition, it is sorted.
O you mean you can get the Maximum path Sum without visiting all the nodes? I figured the only solution would be to visit all the nodes O(n)
@flawr thanks for that answer, that puts a lot into perspective thanx
 
9:09 PM
Remote tech sends in a ticket stating he can't get connected into a printer "I tried all the usual admin passwords, <admin password 1>, <admin password 2>, <admin password 3>, but none of them worked." ... yes, he spelled out the admin passwords in plaintext
 
22
Q: Calculate Euler's totient function

bkulBackground Euler's totient function φ(n) is defined as the number of whole numbers less than or equal to n that are relatively prime to n, that is, the number of possible values of x in 0 < x <= n for which gcd(n, x) == 1. We've had a few totient-related challenges before, but never one which is...

 
@AdmBorkBork The absolute madman
 
More annoying because that particular ticket happened to be one that was audited by security, and so now we get to go change admin passwords on like 3000 printers.
 
RIP in peace
 
9:24 PM
@Rick Since you only said "binary tree" I didn't know if you were talking about a BST or not.
 
Unary trees are actually used a lot more.
 
lol
 
@PhiNotPi it actually just specifies Binary tree not BST
 
9:39 PM
However, I sorta feel like Binary trees, Binary search trees, and heaps, are sort of the same. The only difference is that BST explicitly says the values are directly tied to the vertical order of the graph
otherwise, it's usually just insertion
 
They're all going to feel similar. It's the restrictions on structuring that give each one its own flavor
Hmm, now I can't remember if BSTs are balanced by definition
 
I think they have to be balanced
 
No, binary search trees are not balanced by default. There are a variety of algorithms you can use to rebalance BSTs to make them balanced.
 
if it's not balanced is it still a tree?
 
It is, it's just then you can eat a huge performance hit depending on what you're doing
I.e., the less you branch, the more you're just traversing a list
 
9:51 PM
you're just traveling a linked list at that point.
and if you are just traveling a linked list your going to touch every element, if your target is at the end of the list
that would make it no better than a linear search
 
Yep
 
I always figured a BST was defined by O(log n). But BST wouldn't be the only type of graph that has space that time complexity. I think BST is a bad name. We should call it a balanced graph. Because B-trees have the same time and space complexity as a BST, but B-trees are not binary trees. They are graphs with more than 2 edges on each vertex. sorry I have Beef with BST(as a term)
 
@Rick the term balanced graph is already used for something else
Just note that a BST is a binary tree, and a BST is a B-tree. But any kind of "wild" trees can be balanced. And B-trees only have the same asymptotic complexity.
So what exactly don't you like about the term binary search tree?
 
10:10 PM
@flawr A BST is a B-tree. But a B-tree is not binary?
 
I'm just gonna insert some images from wikipedia because I think that might clear things up...
 
@Rick right
 
binary tree:
binary search tree:
 
The B in B-tree has no official meaning according to its creator
 
@PhiNotPi I well that is not necessarily true, depending on the definition:)
 
10:11 PM
balanced binary search tree:
And as far as I'm aware B-trees aren't really binary trees but a class of similar data structures:
 
I think binary trees and B trees fit into a class of graphs that's bipartite. That makes sense to me, but i could be dead wrong. A binary search tree on its own, seems meaningless, because all a Binary search tree is, is a consecutive set of values that align with the vertical ordering of a balanced tree.
 
If you reduce all data structures like that, it all seems pretty arbitrary. BST is just a BT but the constraint on ordering gives it useful properties
 
That's a good point, I might be abstracting into meaningless oblivion. But in my mind, I need to reconcile the space and time complexities of both trees.
 
[Loud shrug] You do you, man
 
10:27 PM
and that property seems to transcend the "binary" in a binary tree :)
 

« first day (2946 days earlier)      last day (1905 days later) »