« first day (2335 days earlier)      last day (2511 days later) » 

1:04 PM
@ais523 We've had this discussion before, One should not vote to delete spam, it clears the flags. Its important that spam get deleted as spam not as not an answer. For that post I clicked looks ok, and the went and found the post and flagged it.
 
Guys what do you think of a chess KoTH where you play inside of an 8x8x8 cube and the pieces move around inside of the cube? it's 2-player games with two instances of a chess set on either opposite edge and the objective is to capture both of the opponent's kings
 
cannot view :( school wifi
 
Don't worry its not very interesting
 
1:35 PM
Is there a way to put Latex in a question on PPCG?
 
@musicman523 not really, but you can produce a gif or whatnot and upload that instead.
 
@LeakyNun Thanks! I know it can be done on Math.SE but I didn't think it would be on here.
 
https://latex.codecogs.com/gif.latex?YOUR_LATER_HERE works
3
 
@KritixiLithos Oh crap that's awesome
 
Feb 13 at 12:59, by mınxomaτ
You can use https://latex.codecogs.com/gif.latex? and append your latex code encoded.
what
 
1:47 PM
I think I accidentally caused Latex recursion
 
@musicman523 what the hell is that
 
@LeakyNun just my usual garbage
 
how did you do recursion
 
I honestly have no idea it was completely accidental
 
a_1=1\newline a_n=n\text{ iff n is prime}\newlinea_n=\sum_{i} a_i\text{ where $$a_i$$ is a prime factor of $$n$$}
well the newlinea would cause an error
 
1:49 PM
ah yeah that's true
 
and why would you include dollar signs there?
 
because it's within a text block
 
@KritixiLithos you can also use tacos which is easier to remember imo
 
I should have just ended the text block and then started a new one
but ya know, I'm lazy
okay I fixed it but I still don't know how I got it to recurse....
 
1:55 PM
@KritixiLithos I have a solution 4 bytes shorter than that.
 
$latex\space is\space weird$
 
do you use the ⌽⍉⊖ functions?
 
@Adám I literally thought you were saying you had a shorter solution to his Latex message and was like "Nice try Mr. Starbait"
 
@KritixiLithos Yes, one.
 
ah, I don't think I can fully grasp their functionality
 
2:00 PM
@KritixiLithos dyadic and (I use one of those) are very simple; they just rotate in around the indicated axis. Given a scalar left arg, all rows/columns are rotated equally; given a vector left arg, each element indicates how much to rotate the corresponding row/column.
 
@LeakyNun Edited the challenge again.
 
Dyadic is very complex (and powerful) but not relevant for this challenge.
 
@Adám and @LeakyNun Would you mind taking a look at it to see if it's fine?
 
@Mr.Xcoder Yeah, and there's some language I'll fix.
 
@Adám Of course. My English is not the best.
 
2:06 PM
So @Adám what's new in Dyalog APL 17?
 
@Mayube So far, not very much. You do realise that 16 has not been released yet, right? So the 17.0 I'm running is a pre-alpha really. We've removed the JSON I-beams (placeholder features) since 16.0 has a real official replacement, ⎕JSON, there are various speed-ups, and one special system request now returns a result on all platforms (used to only return a meaningful result on Windows).
 
can anybody confirm that this answer works?
'cause i don't believe i end up usually out-golfing somebody like jonathan
 
@totallyhuman from what I can see it does
 
0
Q: Why is this a valid popularity contest?

Wheat WizardI was looking at this question, and noticed while it does lay out its task rather clearly it doesn't really state what the winning criteria is. I scrolled down to the tags expecting that it was a code-golf and the author had forgotten to mention Shortest answer wins!! or some equivalent st...

 
Kolmogorov complexity has pretty easy confirmation
lol
 
2:24 PM
@Mr.Xcoder How is this:
 
@Adám what is the minimum length of the input string?
 
@Adám That's great..
 
@Adám you edited out the line "the string will only consists of characters from a to z and from A to Z", so what can the string consist of now?
 
@KritixiLithos There is no minimum, so that would be 1 (0 is even).
@LeakyNun Anything really. I don't think it is important.
 
2:27 PM
@LeakyNun But spaces should be allowed.
 
You should specify your domain.
I can guarantee you that someone will ask that in the comments if you leave it out.
 
@LeakyNun Added printable ASCII
 
I am pretty sure @Adám will get to 17k rep after posting this challenge
Just from the upvotes from this challenge :))
 
@LeakyNun not just that, Martin and I made new consensus to close as unclear if that's the case...based on already existing wiki
 
OK, thank you guys for all your help, I'll let it sit for a couple of days (you can look at the post to see why)
 
2:38 PM
and Martin has strong close-us-unclear superpowers, as you may already know
 
Is this ready to go public?
3
A: Sandbox for Proposed Challenges

AdámWhat is your Operating System? I can't believe we haven't had this one before To avoid any doubts about what constitutes a separate OS, you must return an index into your chosen subset (containing minimum two) of the following OS families. You may order your set as you like, so include your ord...

 
2:48 PM
@Adám Totally ready to be posted
 
@Mr.Xcoder My only real question is if the score calculation makes sense. bytecount/OScount^2
 
The smaller the score, the better, yes, it does make sense
But how would one now how many Operating Systems its program supports, if they cannot test it on all of them?
Ask the community?
@Adám ?
 
@Mr.Xcoder The programmer would probably know if his program (theoretically) can return each index. Windows users may be able to use TIO to test on Linux.
 
I use macOS, unfortunately :(
 
@Mr.Xcoder s/un(.+):(/$1:)/
 
2:57 PM
?
 
I use Linux so I can test on Linux and...Linux.
 
@Downgoat I don't get it.
 
"Substitute 'un' for ''"
AKA you are fortunate for using MacOS, not unfortunate
I believe it also replaces the sad face with a happy face, with the edit.
 
@Adám So I must return the ordinal reprsenting the OS's indice in a hardcoded set? I can't return like 108 for linux?
 
Ok, sorry for the confusion, I hate regex
 
3:00 PM
The original s/un// was more clear if you know the format, but the updated version is more fun
 
@Downgoat Correct. This is to even out the playing field in that some may have an easy way to get a semi-random number by looking at output from some random command or something.
 
uname is what I was thinking, returns OS/kernel name
 
CMC: given two strings which only have one character in common, make a cross out of those. For example, for the strings cross and mole, output:
  m
cross
  l
  e
 
@LeakyNun nice.
 
can the two strings have more than one character in common?
and btw, nice challenge
 
3:01 PM
@Adám I wanted to post it on main but I would hammer it myself, because it is a subset of existing challenge. I have no idea why I waited so long before posting it here as a CMC.
 
@LeakyNun Related.
 
@KritixiLithos read the first sentence again.
 
@KritixiLithos "which only have one character in common"
 
ಠ_ಠ this always happens to me
 
It is painful to get the common letter of two strings in python :(
 
3:07 PM
ninja'd
 
max(map(s1.find,s2))
 
I know... It's 20 bytes long! I am sure Jelly solves this challenge in 10.
 
ಠ_ಠ_ಠ_ಠ why are you comparing python to jelly
 
@feersum min(set(a)&set(b)) is shorter (cc @Mr.Xcoder)
 
@LeakyNun You need the index to actually solve this challenge though.
 
3:08 PM
wait, our code does different things
@feersum well he just requested the common letter
 
@totallyhuman You can execute Python code in Jelly => Python is a subset of Jelly
 
but you're right, your code would be more useful
@BusinessCat you need a wrapper.
so can you execute Jelly code in Python, with a wrapper (albeit much longer)
 
I'm aware it has many limitations :P
 
@LeakyNun It's also not actually shorter if you adjust for variable names :)
 
@feersum oh, I didn't notice that
 
3:11 PM
It's the exact same length
 
@LeakyNun Dyalog APL 16.0: {W A←⊃⍸⍺∘.=⍵⋄⍵@W⍉⍺@A⍉''⍴⍨≢¨⍺⍵}
 
@Adám byte count?
 
What characters can appear in the strings?
 
@BusinessCat from a to z.
 
3:14 PM
@Adám why don't you include it in your submission?
 
It is.
 
@LeakyNun Because CMCs are less formal, and I'd have to modify the solution to decrease byte count because is not in the Dyalog Classic character set.
2
 
@WheatWizard ugh, this is another ridiculous Stack Exchange bug, isn't it?
 
yes it is
 
3:21 PM
def f(a,b):c=max(map(a.find,b));j=('\n'+' '*c).join;return' '*c+j(b[:c-1])+'\n'+a+'\n'+' '*c+j(b[c:])
 
we need to make a guide to "Stack Exchange bugs that require counterintuitive action when reviewing"
2
 
@totallyhuman Can b[0:c-1] be b[:c-1]?
 
oh yeah ><>
 
(in this case, the fix would probably be to change "Looks OK" and "Delete" to "I'm Done" if you red-flag the post)
 
@LeakyNun Inspired CMC: given two strings, return the indices into the two strings where their common characters are.
 
3:24 PM
@totallyhuman golfed 2 bytes by declaring n="\n" - def f(a,b):c,n=max(map(a.find,b)),'\n';j=(n+' '*c).join;return' '*c+j(b[:c-1])+n+a+n+' '*c+j(b[c:])
 
hold up apparently it doesn't work
 
Wait, what?
 
@ais523 You can't even flag a post from the low quality menu, you have to hit looks ok first and then go find the post to flag it
 
E.g. for "Hello" and "World" return [[3,4],[4,4],[5,2]]
 
@Adám will the two strings always have the same length?
 
3:27 PM
@totallyhuman Your initial solution does not work
And neither does the golfed one, of course
 
yes that's what i meant
 
:38273621 Sorry took a while to draft the comment.
 
apparently i need to change something based on the parity of the length of the string
>.>
 
@WheatWizard i got impatient after seeing the -3. Thanks
 
that makes absolutely no sense
 
3:29 PM
@Poke I'm a little surprised by the -3, I don't feel it was very constructive but -3 seems a little overboard.
 
@KritixiLithos No.
 
@Adám what should I return for "abc" and "aaa"?
 
@Adám Jelly, 10 bytes: L€Œpị"E¥Ðf
 
[[1,1],[1,2],[1,3]] @EriktheOutgolfer
 
@EriktheOutgolfer his example well demonstrates that.
 
3:30 PM
@WheatWizard i feel better now that there's at least some rationale
 
@EriktheOutgolfer [[1,1],[1,2],[1,3]]
 
@LeakyNun I meant what is the case if the second string has many occurrences of a char in the first strings, not vice versa though that's why I asked...
 
@EriktheOutgolfer The two are treated equally
 
@EriktheOutgolfer why would there be any difference?
 
dunno...just wondering
 
3:34 PM
@KritixiLithos I'm waiting for an APL solution.
 
Golfing in progress: {(,↑⍵=⊂⍺)/,⍳(⍴⍵),⍴⍺}
 
@KritixiLithos Nice, you're almost there. Btw, ⍺∘.=⍵ is way more APLy than ↑⍵=⊂⍺.
Being that the OS detection challenge is problematic, maybe I should post this one today:
2
A: Sandbox for Proposed Challenges

AdámTake that frown and turn it around A celebration of the many faces of APL Given a string among those in the two leftmost columns, return the string's neighbor to its right. The codepoints (other than :'s) are listed on the far right. :⊢ → ⍡ → ⊣:   U+22a2 U+2361 U+22a3 :▷ → ⍢ → ◁:   U+25b7 ...

 
Okx
On the ask page, what are the HTTP GET parameters for the body of the post? I've figure out the title and tags, but nothing seems to work for the body (such as content, post, question, text)
 
@Adám {(,⍺∘.=⍵)/,⍳≢¨⍵⍺}
 
How is the input taken for this? (I don't know APL, I assume it's a function). Can you add a tio link?
 
3:47 PM
it is a function
 
>_< 125 rep to 20K
 
@Downgoat (:~) 30 rep to 2K
 
@Downgoat don't you mean 115 rep?
 
but when substitution f for the full dfn in the input section, it works perfectly
 
3:51 PM
@totallyhuman In the meanwhile, someone upvoted one of the posts. The rep was 19875 when I checked @Downgoat 's profile
 
Nice output format:
Was OFF
┌───┬───┬───┐
│3 4│4 4│5 2│
└───┴───┴───┘
 
the boxing is just for the pretty output format
 
@KritixiLithos "Nice output format"
Just appreciating the design
 
4:13 PM
@KritixiLithos Because first you define f, then you load a new workspace, thus discarding the old one that had f.
 
ooh
I remember this from "mastering dyalog apl"
 
@KritixiLithos Correct. Note that in 16.0 we have ⍸←{(,⍵)/,⍳⍴⍵} so the solution is simply ⍸∘.=
 
Question about rules in my answer here:
0
A: Output the text "Code Bowling"

BradCT-SQL, 65 points DECLARE @ char(123)= 'Code Bowling FGHJKMOQSUVWXYZbjkmpqsuvxyz045789 [!?.-":;]{`~#$%^&*_+|\><}' PRINT left(@,LEN(@)/6) I think I got this right, the rules of this contest are a lot different. I'm using the length of the string to determine how many characters I use from the l...

Is MickyT's objection valid? Does my code have to withstand any arbitrary removal of any set of characters?
 
> Un-used Code
All code must be used. Meaning the program must fail to always properly complete the task if any individual character (or varying set(s) of characters) is/are removed. Naturally, a subset of the program should not be able complete the task on its own without the rest of the program.
 
@BusinessCat It holds up when removing any one single character. It has to do so also when removing any arbitrary subset of characters too?
Sigh. Makes this challenge nigh-on impossible (or at least very low scoring) for T-SQL, then.
 
4:23 PM
0
A: Sandbox for Proposed Challenges

CrowleyI was born in 1984 and in 2016 I became 20 years old in base 16. Your task is to take n-digit decimal number - the year - xxyy or kkkll, Split it in half, Calculate the year I had to be born to be xx base yy or kkk base ll years old in the year of xxyy and kkkll, respectively. Your code shal...

0
A: Sandbox for Proposed Challenges

Stephen SCreate a stem-and-leaf plot code-golf Related: Validate a stem-and-leaf plot Input A non-empty list of positive integers. If needed, they can be taken as strings. You cannot assume it is sorted. Output A stem and leaf plot of the numbers. Newlines separate the stems, spaces separate the ste...

 
music I wrote this morning: soundcloud.com/phinotpi/counterpointc first half is meh but the last quarter is legitimately good
 
@KritixiLithos If you want to avoid the "Was OFF" message, use ]←box on
 
4:41 PM
Hello
 
ayy
 
@PhiNotPi What about the 3rd quarter?
 
@ZacharyT between the two?
 
Mhm.
 
Should I undelete my answer at codegolf.stackexchange.com/questions/127535/… . Or wait a little more?
 
4:57 PM
0
A: Sandbox for Proposed Challenges

xnorRoll identical boson dice code-golf random When you roll two dice, the chance of a 5 and 6 in either order is a 2 in 36 (or 1/18), since it could happen as (5,6) or (6,5). But (6,6) can only happen one way and has a 1 in 36 chance. Our dice will instead work as identical bosons: (5,6) and (6,5)...

 
@Arjun I tend to answer my own challenges within an hour or so of posting, and I have yet to receive any criticism for it.
However I also only use my own language, Braingolf, which to my knowledge only one other person in PPCG currently uses at all
 
@Mayube Wow. I wait a week, and sometimes months.
@EriktheOutgolfer TIL that tags are spaces separated. And: Thanks.
 
So, what do I do now?
 
@Adám huh?
 
5:04 PM
Uggh I'm reading the PPCG languages post on meta and its reminding me how many languages I've got
 
I think answering your own challenge within a short period looks like preying for rep if answered with a special language, or blocking other answers if using a common language
 
@Adám yeah it's some thin whitespace so that they don't stick together
 
@EriktheOutgolfer Looks like regular spaces to me.
 
@Uriel As of now, a shorter solution exists, having a positive score.
 
whatever, it just doesn't look really nice with ...][tag:...
 
5:07 PM
0
Q: Take that frown and turn it around

AdámA celebration of the many faces of APL Given a string among those in the two leftmost columns of the below table, return the string's neighbor to its right. The codepoints (other than :'s) are listed on the far right. :⊢ → ⍡ → ⊣:   U+22a2 U+2361 U+22a3 :▷ → ⍢ → ◁:   U+25b7 U+2362 U+25c1 :⋆...

 
@Arjun nobody really cares about the shortest byte count, every entry (as long as it is contributing) is counted on its own. that's why old posts are being answered
 
@Uriel Then, what prevents any one from not caring about my solution, too?
 
For anyone who cares, this is all my languages that I'm working on/finished
 
@cairdcoinheringaahing Good luck!
 
@cairdcoinheringaahing CMC: count @cairdcoinheringaahing's unfinished languages.
 
5:11 PM
@cairdcoinheringaahing jeez even I'm not that bad, I only have 3
 
OMG. Are they even similar?
 
@Adám I've lost count
 
I'm working on one and have pretty much abandoned two others (probably for good)
 
@ZacharyT nope
 
@cairdcoinheringaahing I only have 1.
 
5:12 PM
@Adám different version of APL?
 
Presumably that one is Dyalog APL
 
no he works for Dyalog
 
@cairdcoinheringaahing github.com/abrudz/kk
 
@cairdcoinheringaahing Oh, I wasn't counting Dyalog APL. Version 16.0 is in code freeze, and I hav not done anything on 17.0 yet (soon though!).
@Uriel Exactly. Not much there.
 
How on earth do you keep up with that many languages‽
 
5:14 PM
I got pinged 7 times in the past minute :/
 
@cairdcoinheringaahing Does this ping you twice, @cairdcoinheringaahing ?
 
It makes 2 noices but shows up once @Adám @Adám @Adám
 
@cairdcoinheringaahing I only heard one.
 
Wierd
what browser are you using?
 
@Uriel There too. No stutter or anything.
 
5:16 PM
@cairdcoinheringaahing what's that an esolang?
 
@EriktheOutgolfer what's an esolang?
 
esoteric language
 
Wonder if one can get kicked for ping-spamming… like pinging everyone in the room. Hm.
 
Esoteric Programming Language
 
5:17 PM
I think it counts as noise?
 
@Adám @Arjun @ais523 @ASCII-only @ATaco
 
please stop...
 
Time to get kicked...
fine
 
To flag or not to flag…
 
@Adám Seriously.
 
5:18 PM
That is the question
 
@Adám 2 🎌 ∨ ~ 2 🎌
 
LOL.
 
? 2 - ∨ ! 2 -
 
Did anyone notice that Rene Descartes forgot to doubt his logic?
He doubted everything except doubting that doubting can make him a being.
Why can the logic he was born with not be doubted?
 
@Arjun It certainly could. Have you never observed someone making a false "logical" conclusion?
CMC: Given a string, return "flag" if it contains two or more @s, else do nothing or print a newline.
 
5:23 PM
@TuxCopter how do u live on Uranus, it is all gas, where do u stand
 
@Adám Doubted in another sense. Our minds, according to our logic, tell us that 3 stones are more than 2. But is that the reality.
 
@Arjun Is it now?
 
Aren't we just biological machines shaped by natural selection?
 
also atmosphere is too dense for 50% of u (copter pat) to fly
 
Understanding the nature of reality is not what we are made for.
 
5:24 PM
 
@Adám JavaScript: s=>/@.*@/.test(s)&&"flag"
 
@Adám CJam, 14 bytes: "flag"q'@e=(g*
It crashes if there's 0 @s but that should be fine, it prints nothing to STDOUT
 
20 bytes, APL: {'flag'/⍨~1<+/'@'⍷⍵}
 
@Adám Python, 32 bytes: lambda s:'flag'*(s.count('@')>1)
 
Dyalog APL, 19 bytes: {'flag'/⍨2>+/'@'⍷⍵}
 
5:28 PM
@ZacharyT It's so funny how a lot of people use instead of =. I guess the assignments from other languages make them scared of =.
 
Or because it's called find.
 
@BusinessCat That fits well with my feeling. If people don't ping it is so hard to follow the conversation. I often don't know if something was said to me.
 
@betseg you have extra r strrchr
 
I know
String reverse char
 
5:30 PM
oh ._.
can't you use a < and save 1 byte
 
Checks if the first and the last @s are the same
 
@Downgoat prolly
 
@Adám Cheddar, 33 bytes: s->s.bytes.map(c->c^64?0:1).sum>1
 
:O cheddar
@LeakyNun golfed: @.test(/@.*@/)
 
5:32 PM
lol
 
@ZacharyT I can do it in 17.
 
'flag'/⍨2<∘≢'@'∪⊢
 
@Adám V, 19 bytes: Try it online!
Wait, 18: Try it online!
 
I think I screwed it up.
 
@ZacharyT Ah, yes, it doesn't work. Clever though.
 
5:38 PM
Golflang design question: Should string repetition by a negative number reverse the result, use the absolute value instead, or use 0 instead?
 
Here: 'flag'/⍨'@@'(≡∩)⊢
 
@ZacharyT Nope.
@ZacharyT Note that and are not commutative. You're almost there. I now have two 17 solutions. One based on yours and one of my own.
 
-1
Q: Construct a multiparticle quantum state

FrodCubeSandboxed here and made less complicated and hopefully more fun. Summary of the challenge Given a number particles, either identical bosons or identical fermions, output the total wave function of the state assuming they are all independent. Physics background Don't worry, you don't need to k...

 
5:54 PM
I just realized something.
Even if I get my account back, I lost all of my progress on the Fanatic badge.
And I was at around 98/100 days ಠ_ಠ
If they give me my account back I'm going to bug them about that.
 
they probably don't care much about your little account
 
That is true.
Considering I wasn't really a high-rep user.
But either way, I might end up making an MSE post about it, hopefully preventing this from happening to other people.
But ¯\_(ツ)_/¯ it took me only like 3-4 months to get all of the rep I had; the rest was about 1000 rep over the course of about a year and a half.
So if I stay active, I can gain rep pretty quickly (i.e. today; 190 rep, 290 if you count the bonus).
Actually it's not too bad to start over again from the beginning. I still remember back when I was a low-rep user.
and rep is just internet points, they don't really mean anything :p
 

« first day (2335 days earlier)      last day (2511 days later) »