« first day (3013 days earlier)      last day (2126 days later) » 

00:07
apparently I've reached it 48 times
 
1 hour later…
01:31
-9
A: What should this site be called now that it's getting a design?

MilkyWay90Code Competitions and Golf We need to mention "Code Golf" in the title because it makes up a large portion of all open questions (as manassehkatz quoted xnor). We still should address that we are okay with other programming competitions, since 9% is still a notable percentage, hence the name ("C...

That got a lot more disagreement than I expected
01:43
@DJMcMayhem For actual repcapping (not 200/day), my longest streak is 24 days (Oct 28 '15 to Nov 21 '15).
@Dennis What is the actual repcap
Wait, can I get answer-banned from PPCG because of my meta name suggestion (see answer above)?
Anonymous
@MilkyWay90 No, answer bans require a significant history of low-score answers
@Mego Oh
Anonymous
Also IIRC answer bans on meta are separate from main
Anonymous
01:55
It's totally ok to have an unpopular opinion, so the system doesn't punish you for that
Anonymous
Hence why there's no rep gain/loss on meta
Good, if I had gotten banned from posting on main, that would have been sad
Code golf makes a daily part of my life
@MilkyWay90 The rep cap lets you earn up to 200 rep/day from upvotes. Other sources of rep (accepts, bounties, etc.) do not count towards the rep cap.
@Dennis Oh, okay
My longest streak is 0 days
I think to get actual rep, I should make a quine in Turing Machine But Way Worse
But that's way too hard
Quining in a regular programming language is way to hard for me already
Capping from a single answer is possible, but I mostly capped because I posted a ton of content back then.
02:01
Also, you can repcap but not actually get 200 rep (if you offer a bounty for example)
@Dennis I wasn't meaning to get a repcap
@DJMcMayhem Or someone unupvotes you.
@Dennis You lose rep from that?
Guess nobody has un-upvoted me before
Rep you can't get back that day, yes.
@Dennis oh
1
A: Print a square!

MilkyWay90Turing Machine But Way Worse - 3251 bytes 0 0 0 1 1 0 0 0 1 0 1 2 0 0 0 2 1 0 3 1 0 0 3 1 0 4 0 0 0 4 0 1 0 0 0 1 0 1 1 1 0 0 1 1 0 0 2 0 0 1 2 1 1 5 0 0 0 5 0 1 6 0 0 0 6 1 0 7 0 0 0 7 0 1 3 0 0 1 3 1 1 8 0 0 0 8 1 0 4 0 0 1 4 1 1 5 0 0 1 5 1 1 9 0 0 0 9 1 0 6 0 0 1 6 1 1 7 0 0 1 7 1 1 10 0 0 0...

I'm going to golf this brb
My windows notification system keeps on repeating the "You just plugged a device into the audio jack."
UGH
It keeps on doing that
whenever the slightest change to my headphones happen
02:05
That can happen if your audio jack isn't grounded properly. From experience.
Do you get any buzzing or lack of clarity in the headphones?
Pops/beeps?
No
The headphones are really messed up though; They have been chewed by my dog when they fell.
I'm glad Turing Machine But Way Worse is on tio.run
I guess that could cause ground issues but it's more likely your headphones are broken.
ngn
ngn
02:22
@Dennis @DJMcMayhem @Doorknob @Mego could you grant chat.stackexchange.com/users/407756/user997521 write access to chat.stackexchange.com/rooms/90748/the-k-tree please?
@ngn yep
ngn
ngn
@Doorknob thanks
 
1 hour later…
03:30
0
Q: Alphabetical Justice Warrior

LWChrisAaron is a young game developer. In school, he was always the first who had to to present his homework. That's why he became very concerned about the equality of the letters in the alphabet. Well, at least for those of the English alphabet (so much for that, I guess). Aaron recently joined the d...

03:56
Finally another challenge...
 
7 hours later…
10:39
0
Q: A question, on the use of bfs, for finding a path

kenithPan is about to travel on the bus. He wishes to start from a certain city A and reach the city B. However, the bus, may not be able to take him from city A to B. 1/ If the bus can take him from city A to B, the cities between A and B, should appear. 2/ If the bus can't go from city A to B, the ...

 
1 hour later…
11:56
2
Q: Enumerate Derangements

flawrGiven some positive integer \$n\$ generate all derangements of \$n\$ objects. Details A derangement is a permutation with no fixed point. The output should consist of derangements of the numbers \$(1,2,\ldots,n)\$ (or alternatively \$(0,1,2,\ldots,n-1)\$). (This means in every derangement numb...

12:06
@flawr I'm surprised we didn't have this challenge already on the site
I feel like I've seen a derangement challenge before but can't remember nor cbf to go looking
12:28
@Fatalize that is why I'm posting it:)
@Veskah there was one or two about generating random derangements (secret santa problem)
Ah, that was probably it
hi all
allo
@Veskah i, ow are you?
@Adám Fine sank you. I wish I was a bird
12:36
@Veskah I paid my fine, but it didn't make me sink.
Nice
:D
<(°v°)>
wait do lizards have beaks and wings
Ha ha, I forgot to save one of the queries I wanted yesterday. Son of a gun
:'DDDDD
12:48
@Adám I've seen that before but still good. I was quoting this because I'm a filthy weeab youtube.com/watch?v=nlLhw1mtCFA
@EriktheOutgolfer there are lizards with wings, but birds have scales
wasn't talking about birds at all here :P
any beaked lizards around?
Helps if I post the correct link, eh?
0
Q: Upside-Down Pyramid Addition...REVERSED!

WhimpersUpside-Down Pyramid Addition is the process of taking a list of numbers and consecutively adding them together until you reach one number. When given the numbers 2, 1, 1 the following process occurs: 2 1 1 3 2 5 This ends in the number 5. YOUR TASK Given the right side of ...

 
1 hour later…
14:12
practical big data question :) Say you have lots of sets of integers which you can preprocess. Call that set S. A query takes another set x and asks which of the sets in S is a superset of x.
is there some nice way of doing this? it's feels a little like a google type web search
14:30
I mean.. call that set of sets S
14:50
@Anush size of S = n, size of x = k, subset size = m; to get a better speed than O(n), you need to involve the result size in the output, and i have no idea how to do that while removing the n factor
0
Q: Type-check an expression

SkidsdevGiven a conventional infix expression consisting of standard dyadic mathematical operators (specifically: +-/*) determine whether the expression is correctly typed. In this fictional language, there is no type coercion, so for example "Hello" + 4 does not result in "Hello4", it results in a type...

@dzaima hmm.. isn't this roughly what google does in a very crude sense? I mean each document is a bag of words and a query is some subset of those words?
@Anush google allows subsets, supersets, different formats, scores the pages, and has room for error
0
A: Sandbox for Proposed Challenges

AnushMaximizing by swapping Input An integer n in the range 100 to 10^18 and an integer k in the range 1 to 18, inclusive. The swap operation A swap choose two digits at different positions and exchanges their positions, as long as the swap does not result in a leading zero. For example if we star...

@dzaima all true. So you think the subset only question might be much harder?
14:53
@Skidsdev re: your challenge -- does that basically mean "Check if each side of the operator is the same type?"
15:04
@AdmBorkBork See comments from Adam. It's basically just "Are all constants in the expression of the same type"
0
Q: Decoding or ( decrypting ) 16 digits number

Jafar AkhondaliI've got some number as plaintext and some ciphertext as output. So what i'm trying to do is basically a known plaintext attack. The input and output length is 16 digits Digits have been divided to 4 groups to make them more readable I've marked same numbers in their place with + and opposite nu...

15:36
if anyone has any comments on my sandbox challenge, gratefully received
I would ideally like to add a restriction on the time to stop naive brute force solutions that don't actually terminate
15:49
@Anush A swap choose two digits should probably be chooses
You also don't relate k to the challenge. I'm assuming it's the number of swaps to perform
@Veskah Output the largest number you can get after exactly k swaps.
it's in there
Yeah, reread it. My bad
chooses fixed, thanks
ngn
ngn
@Anush i wonder, do you have your own solution for the power tower challenge?
@ngn only really the linked math.se answer
@ngn there might be a simplification given that my question is quite restricted
I do like how surprisingly hard it is
ngn
ngn
16:06
@Anush yeah, it's the best challenge i've seen that has more downvotes than upvotes :)
@ngn There should be a badge for that!
I have learned over the years that asking two questions at the same time that look the same but are really completely different is a) something I really enjoy doing and b) something the ppcg community really hates :)
ngn
ngn
@Anush people just assume that small changes in the size of the input don't lead to large changes in the algorithms required
@ngn right.
Another problem is that most people only tend to like easy challenges
@H.PWiz that is true. However there have been some really hard problems tackled on ppcg before
ngn
ngn
16:14
@ngn a historical example of this is cubic vs quintic equations
maybe there is some way of phrasing hard problems so the people who like easy ones aren't upset by them
@ngn :)
if you can manage 8 upvotes between you that would be great :)
@ngn makes me think of ODEs vs. PDEs
only one letter different! :)
of 2sat and 3sat
how much difference can adding one possibly make?
-2
Q: Show a pyramid of numbers that are powers of two

Robert MooreWe are looking to display numbers in a pyramid fashion so that higher powers of two are in the middle and farther down. This one should be simple!

16:30
@ngn thanks for spotting the bugs in the existing answer!
17:20
z=[];G=global;K=[];_=18817[E=`toString`](29);[String,
Math][_](o=>Object.getOwnPropertyNames(o)[_](p=>{G[Q=
String.fromCharCode(parseInt(p,36))]=o[p];z.push(Q);K
.push([o,Q,p]);}));z[_](A=>z[_](B=>G[A+B]=(...P)=>G[A
](G[B](...P))));A=[...[,,]].map(_=>z).map(e=>[...e]).
reduce((a,c)=>(W=[].concat(...a[_](e=>c[_](d=>[d,...e
]))),W[_](e=>G[e.join``]=e.reduce((A,C)=>(...B)=>A(G[
C](...B)),x=>x)),W));(s=>z=>y=i=>i<z?y(i+s,([j,k]=[i,
-i][_](e=>8+შ鑏(䱷(e)*䀼㑈(e)*5))[_](㑈).sort((a,b)=>a-b),
console.log("*".padStart(j)+"-".repeat(k-j)+"*"))):0)
17:42
@ConorO'Brien I've no clue what this is but I like the chinese character functions
0
A: Sandbox for Proposed Challenges

BeefsterTeam Rocket Blasts Off at the Speed of Light! code-golf kolmogorov-complexity Output this text: Prepare for trouble! Make it double! To protect the world from devastation! To unite all peoples within our nation! To denounce the evils of truth and love! To extend our reach to the stars above!...

 
1 hour later…
18:51
Hmm, I think the time complexity of working with Directed Graphs is going to screw over my project here
19:18
is it possible to insert-if-not-exists a node into a Directed Graph in O(1)?
19:39
no of course it's not that would imply checking if a graph contains a node in O(1)
anyone know how to make title border in CSS for a textarea/input?
basically like
+-- title here ----------+
|                        |
+------------------------+
every SO post (like, one) says to use background-color: white but that won't work because my background might be an image
@HyperNeutrino Why not use <fieldset> and <legend>?
I tried but it surrounds the text field instead of bordering it
i might be able to screw around and get rid of the normal border and compress it with negative padding/margins
19:57
@HyperNeutrino like this?
yeah that's approximately what i wanted
i am confused as to why i can't seem to get my thing to size properly (it's either tiny or it overflows the box) but i can figure that out
thanks
@HyperNeutrino Updated link to allow the label to appear further towards the right.
oh cool, thanks
@HyperNeutrino Updated link to show some formatting possibilities and to fix a width issue with the input field
20:17
Are you interested in working for Dyalog? We are looking for a Graduate Programmer/Language Implementor to join our team based in the UK. For more details head to our website http://dyalog.com/careers.htm
20:41
@flawr I hope the two (minor) modifications are appropriate
0
Q: Convert Brainf*** program to a C program in linux

ConfusedStudentBrainfucks (the programming language) symbols is as shown move right < move left + increment the contents of the current memory location - decrement the contents of the current memory location . output the contents of the current memory location , input 1 byte to the current locatio...

21:00
@LuisMendo sure thanks a lot!

« first day (3013 days earlier)      last day (2126 days later) »