« first day (2232 days earlier)      last day (2907 days later) » 

16:08
@ASCII-only I do and that is what I use. But I answered before I joined :P
@AdmBorkBork I have great ideas then A. It turns out to be bad or B. It is a dupe
@AdmBorkBork codegolf.stackexchange.com/questions/108592/… what do I need to fix so it will be reopened?
@DownChristopher You have parse left to right and close before opening but you also have triple-asterisks
@DownChristopher For me, I have great ideas then A. downvote overload B. more downvote overload
@Riker does clicking fork button crash for you btw?
@MatthewRoh do you mean your questions get downvoted?
16:21
Maybe it's because you ask bad questions and/or don't bother with sandbox
@MatthewRoh do you use the sandbox?
@AdmBorkBork ok I removed the *** rules
that may be taken wrong.
@fəˈnɛtɪk questions are downvoted for a number of reasons in my experience.. those are two of them
@Lembik No, unless I feel its extremely unnecessary
@MatthewRoh that may explain it
16:22
I removed the ripple-asterisks rules
try it and see
but luckily it happens less frequently now
@DownChristopher Well, but that doesn't fix **. Because that should be <em></em> by the parse left-to-right greedily rule.
@AdmBorkBork Hmm I guess I will remove ** also
You know, do you necessarily have to parse left to right?
16:24
would anyone kind me able to compute the answer for n = 1,2,3,4 so I can add them to the question? meta.codegolf.stackexchange.com/a/11731/9206
@DownChristopher #, ##
please
@AdmBorkBork I just removed that rule about how you have to parse
It was a silly rule
@Lembik ...oh.
OK, so what happens with mismatched markdown?
16:26
@DownChristopher then you eventually remove everything
Like *test **words** foo*?
That actually is nested markdown
Is it? Or is it three italics in a row?
speaking of markdowns, *` on each side makes it sarcastic
16:28
@Lembik This may be a dumb question, but how do you define "smaller than" and "bigger than" with vectors? Which of (0, 1) and (1, 0) is smaller?
really?
oh wow
it really does
@ETHproductions Those two vectors are not ordered. Do I imply all vectors are ordered? Let me check
@ETHproductions I think its the length calculated with the Pythagorean theorem, thus the answer is equal
@MatthewRoh no!
:)
@Lembik Oh, did you mean that in another way?
16:31
@ETHproductions I don't think I imply that all vectors are ordered
@MatthewRoh yes... it is elementwise comparison.. This is from meta.codegolf.stackexchange.com/a/11731/9206
> Say x = (0, 2, 2, 3, 0) and y = (2, 1, 4, 4, 2) as examples.
So those are unordered vectors?
yes
but (0, 2, 2, 3, 0) and (4, 2, 8, 8, 4) are ordered
(0, 2, 2, 3, 0) < (4, 2, 8, 8, 4)
Ohhhh... unordered as in neither is specifically larger?
Thats a bit too much math for me
@ETHproductions exactly. It's a partial order
@MatthewRoh it's only less than and greater than :)
16:35
So (1, 0) and (0, 1) are close
Wait
no!
no, they're not
Science books these days are too absurd they say 'yo momma so fat things 1m far away accelerate 5m/s towards her.' or something. Does that mean yo momma is fatter than the moon?
you just have to ask is one of these true y <= x <= 2*y or x <= y <= 2*x
if so, they are close
if not, they are not close
So that means that each pair of elements has to be... um... close
I get it now :P
16:37
:)
thanks so much for looking at this!
So an example of close vectors would be (2, 3) and (2, 2)
yes!
But not (2, 3) and (3, 2)
I think those are gone-wrong vectors
But (1, 2) and (2, 3) are close as well
I'm getting the hang of this :)
So now for the actual challenge...
I think for n=1 obviously the result is 2: (0) and (1)
For n=2 there are 9 possibilities, from (0, 0) to (2, 2), so...
Each of (1, 1), (1, 2), (2, 1), and (2, 2) are close to each other, except the middle two
And (0, 1) and (0, 2) are close, and vice-versa
So I think the optimal set is (0, 0), (0, 1), (1, 0), (1, 2), (2, 1)
16:46
0
Q: Calculate my reading speed

Down ChristopherYou must create a program that calculates my reading speed! The challenge First when the program is run wait for user input (a click or a keyboard key being hit you may choose one. When the user "triggers" the program print the paragraph below. Then when the user hits another key/click end the ...

So far we have 0 -> 1, 1 -> 2, 2 -> 5
@ETHproductions looking good!
For n=3, there's 4^3 = 64 options, which means 2016 pairs... I'm gonna have to write a function or something to help me out
cool
forget that :)
Yeah, haha
16:50
I can delete history :)
And I can still read it. :)
damn!
If both vectors have any item larger than the corresponding item in the other, they're not close no matter what
right
close=(a,b)=>a.every((x,i)=>b[i]<=x&&x<=b[i]*2) || a.every((x,i)=>x<=b[i]&&b[i]<=x*2)
^ ES6 code I'm using
In Python you could change <=x&&x<= to <=x<=, but oh well
16:54
@Lembik You just need to figure out how to get into stackexchange's servers
Continuation of my conversation from a few hours ago: I think I've figured out why the recursion didn't work. Calculator++ may have been trying to reference the dummy function that I wrote first to get the name in the list of defined functions.
As in when I wrote fib(x), I first defined it as x, so that I could use the name upon editing. I think that may be screwing my function up somewhere
@Lembik I suppose this problem could be rephrased as "given the set A of all Hamming distance vectors of length n, find the smallest subset B such that every close pair in A contains a member of B"
if that makes sense
2
Q: Pali-n-drome this List

carusocomputingThe challenge here is to extend an implementation of palindrome given the following as inputs: n > 1 and a list l. Your program must palindrome the list both vertically and horizontally, that is to say it must first palindrome the list itself, then each element in the list after; or the othe...

17:09
Fun fact: for n=3, there are 152 close pairs
@ETHproductions yes I think that works
how did you work out 152?
I wrote a program to solve it
that seems a lot. There are 256 Hamming distance arrays in total, right?
64, actually
which makes for 2016 pairs
oh .... I was doing 2^3 * 2^(6-1)
what should it be?
17:18
I'm now trying to find out what's the smallest subset that can be removed from the set to remove all close pairs
oh 152 close pairs!
sorry I misunderstood
@Lembik 4 possible values ^ (choose one 3 times)
the correct output for n=3 must be less than 48
Why's that?
that's the total numbre of distinct hamming distance arrays for n = 3
17:19
but... I thought it was 64?
the key word is distinct
ah.. maybe I didn't mention that in the question?
Wait a minute... not just any n-length vector of items in 0..**n** can be a Hamming distance array, can it?
no it is there
no!
Dangit
Let's try that again...
try n = 2 and you will see
@ETHproductions [(0, 1), (1, 2), (0, 0), (2, 1), (0, 2), (2, 0), (2, 2), (1, 0), (1, 1)]
17:22
@Lembik by n length substring does it need to be continuous?
those are the only hamming distance arrays for n = 2
@fəˈnɛtɪk contiguous yes.
as in no gaps
@Lembik But that's all 9 possible vectors
for n=3 it's 48 though? because there are 64 possible vectors
OK, that makes more sense
[(3, 0, 2), (0, 1, 1), (0, 3, 0), (1, 3, 2), (3, 0, 3), (1, 0, 0), (1, 3, 1), (1, 0, 1), (3, 2, 1), (1, 3, 0), (2, 0, 3), (0, 2, 1), (2, 2, 0), (1, 1, 1), (0, 3, 1), (3, 3, 3), (2, 3, 2), (3, 3, 2), (0, 2, 3), (2, 3, 3), (0, 2, 2), (0, 1, 2), (3, 2, 2), (2, 0, 1), (1, 2, 0), (3, 1, 2), (3, 2, 0), (1, 2, 1), (3, 1, 0), (3, 1, 1), (1, 1, 0),
(1, 2, 2), (2, 0, 2), (0, 0, 1), (1, 2, 3), (0, 0, 0), (2, 1, 2), (2, 2, 3), (0, 1, 3), (2, 3, 1), (2, 1, 3), (2, 2, 2), (2, 1, 0), (2, 2, 1), (2, 1, 1), (1, 1, 2), (1, 1, 3), (1, 0, 2)]
that's n = 3
it might help if I sorted them
17:24
yes
[(0, 0, 0), (0, 0, 1), (0, 1, 1), (0, 1, 2), (0, 1, 3), (0, 2, 1), (0, 2, 2), (0, 2, 3), (0, 3, 0), (0, 3, 1), (1, 0, 0), (1, 0, 1), (1, 0, 2), (1, 1, 0), (1, 1, 1), (1, 1, 2), (1, 1, 3), (1, 2, 0), (1, 2, 1), (1, 2, 2), (1, 2, 3), (1, 3, 0), (1, 3, 1), (1, 3, 2), (2, 0, 1), (2, 0, 2),
(2, 0, 3), (2, 1, 0), (2, 1, 1), (2, 1, 2), (2, 1, 3), (2, 2, 0), (2, 2, 1), (2, 2, 2), (2, 2, 3), (2, 3, 1), (2, 3, 2), (2, 3, 3), (3, 0, 2), (3, 0, 3), (3, 1, 0), (3, 1, 1), (3, 1, 2), (3, 2, 0), (3, 2, 1), (3, 2, 2), (3, 3, 2), (3, 3, 3)]
there is no 0,0,2 for example
or 0,0,3
or 0,1,0, or 0,2,0
but there is a 0,3,0
right
17:26
hmm
I don't see any obvious characteristic of the ones that are left out
(-1, 1, -1) (-1, 1, -1, 1, -1)
that gives 0,3,0
it's definitely not obvious
hence the need for computers :)
I'm sorry, why -1 and 1 there?
Ah, those are just the values of bits
(0, 1, 0) (0, 1, 0, 1, 0)
:)
it's the same
yep, got it :)
I was experimenting to see if inner products were any different and it's nice to have +-1 then
17:29
yep
@TuxCopter I would rather think it was intentional
So of that array, 2,2,2 is the closest, with 13 pairs
interesting
@Lembik That one is definitely intentional.
17:32
@fəˈnɛtɪk I make no comment :)
> If you live in Antarctica contact us for a special discount!
@Lembik I think the best method for removal is removal by power of 2,
?
@ETHproductions I don't think I can post the question until we have a few answers.. someone will shout at me :)
also... is it code-challenge?
2,2,2; 2,3,2; 2,2,3; 3,2,2; 2,0,2; 1,1,2; 1,2,1; 2,1,1; 0,1,2; 2,1,0; 1,2,2; 2,2,1; 0,2,1; 1,2,0; 2,1,2; 2,3,3; 3,3,2; 0,2,2; 1,0,2; 2,0,1; 2,2,0; 1,1,3; 1,3,1; 3,0,3; 3,1,1; 0,2,3; 3,2,0
17:39
nice
how many is that?
I believe that is one optimal subset that, when removed, removes all close pairs
Um... 27?
which leaves us with 21 vectors without a single close pair
that looks good. Do you want to add the numbers for n =1 to 3 as a comment?
so that it doesn't look like I am stealing them :)
@Lembik there, done
thanks!
Ooh, the xkcd Phone 5 came out today.
17:48
Are you getting it?
Seems a little dangerous
Given that it melts at 85°F, I'm going to pass...
I doubt it gets over 29ºC here
After all, what's life without a bit of risk and adventure?
Just because it melts below body temperature doesn't mean there is going to be any problems.
17:52
@Lembik I believe the optimal set for n=3 is
0,0,0; 0,0,1; 0,1,1; 0,1,3; 0,3,0; 0,3,1; 1,0,0; 1,0,1; 1,1,0; 1,1,1; 1,2,3; 1,3,0; 1,3,2; 2,0,3; 2,1,3; 2,3,1; 3,0,2; 3,1,0; 3,1,2; 3,2,1; 3,3,3
@Downgoat if that's the button in the top right then yes
it does crash
How's the app?
@Riker
pretty good
sorry half afk
two things @Downgoat: first the imgs when you launch the app and sign in, the profile pics are always yours
second, the fork icon should probably be tweaked, it's not intuitive (to me at least)
@KritixiLithos very nice UI
@Lembik Do you think it's safe to assume that the greedy algorithm (repeatedly remove the vector that's part of the most close pairs) will give the optimal output?
18:03
@Riker I suspect that's intentional.
I mean, what else did you expect from an app called Gitgoat
I can't even fathom how the greedy approach would not be optimal in this case
OK, unrelated but I can't be the only that noticed that @AlexA. came back on the same day as @Geobits
@quartata That's because they are the same people
That's the point.
Okx
Okx
wow, ruby is winning my music boxes question, there's no pyth, cjam, 05ab1e, jelly... surprising
18:12
Ruby beat my JS answer? Nooooooooooooooo.....
@ETHproductions No I don't
@Okx Ooh, only 1 byte less than Röda
Okx
Okx
xD
@Lembik I think that finding the optimal set in your case is very similar to solving sudoku, which is a known NP complete question.
@fəˈnɛtɪk I am sure you are right
18:14
@Lembik No? I guess the safe way would be to look through all combinations, starting at length n, until one without close pairs is found
@fəˈnɛtɪk that's why the question doesn't require optimality
I'll give it a go in CJam but I'm tired after doing it in Retina
@ETHproductions greedy might still give quite a good answer though
there is no requirement for optimality
What's with the name changes going on recently?
I'm sure the optimal answer can't be too much higher than the greedy answer
18:16
right
@Lembik Now that I can fathom the challenge, I'll read it again to see what the point is :P
@ГригорийПерельман The 29-factor auth seems pretty secure
@quartata It's so weird how every time I say something in chat, I'm "back". Apparently I've come back five or six times in the last couple weeks.
Hey, Geobits is back!
:P
0
A: Sandbox for Proposed Challenges

Filip StachowiakGoogle search result short summary string fastest-code search Intro When you search in google, it always shows you a result with a sample text from the found webpage. For example if you search for "Madonna greatest vinyl", google will show you one line link, and below a short excerpt from th...

18:20
@Geobits It's because you and Alex are like the crazy old uncles from anther country that occasionally show up to family reunions. :P
@TuxCopter only 28-factor. So just so-so.
Except the reunions are every single day
Does anyone know how to loop in golfscript?
I have to ACK every now and then. I don't want there to be a starred message over there talking about how I must be dead or something.
Geobits hasn't sent a message in over thirty seconds. He must be dead or something.
16
18:23
@ETHproductions :)
@DJMcMayhem Well I'm glad someone took the bait :D
I learned from the best :P
0
Q: C++ Bubble sorting two dimensional array

user65134I have an exercise that requires to sort time array like this one Input Output 10 20 30 7 30 0 7 30 00 10 20 30 23 59 59 13 30 30 13 30 30 23 59 59 I created a 2 dimensional array and here is my input for (int i = 0; i <a; ++i) {...

i heard that our design will come with the 2017 survey results?
@betseg What's up with your avatar?
18:30
can you not see it?
I don't know
@betseg Sorry, not until November.
@betseg Our design will come in the end times
@betseg Looks like the "broken image" icon to me. I suppose that's the point
@Geobits Which November? ;)
18:32
Ah, that's the crux
Yeah, it's a fake broken image
It's really obvious in the user list over there --->
It's still... unsettling
@Lembik I guess my main concern is, how can any output an answer gives be proven optimal/correct?
@ETHproductions heh
Also I'm having a hard time digesting this sentence:
> Your score is the highest n for which no one else has posted a higher correct answer for any size which is smaller than equal to this.
@ETHproductions by solving for every possible set. I think you will end up with O((n!)^2) time
18:41
@KritixiLithos The november in 6 to 8 weeks
@fəˈnɛtɪk Well, it depends on the formula for how many Hamming distance arrays of length n there are
0
A: Sandbox for Proposed Challenges

VoteToCloseAndroid Lock Screen Art graphical-outputpermutationscode-golfgrid Background In the land of Android, there exists a password type that looks like this: It's essentially a connect-the-dots for a password. Today, we'll be making art with it. The Task Your program should export as many dis...

Hmm, that sequence isn't on OEIS, so technically we're contributing to math history!
btw, the sequence starts out 1, 2, 9, 48, 297, 2040, 15425, 125232
@quartata lel
19:00
@Lembik One other thing I noticed is that if x is in the set, both the reverse of x and the inverse of x (i.e. 0,3,2 -> 3,0,1) are also in the set
and vice-versa
Woo, that's a neat feeling -- golfing 3 bytes off a 35 byte answer.
@Downgoat also in case it matters: it doesn't crash, it just freezes
the repo name + username of the owner is there, but the rest is blank
I'll take a pic later
19:16
@mınxomaτ Took me a good part of an hour before it hit me how impressive that was.
oh nvm it crashes 9/10 times that was a random fluke
For cops and robbers q's.... how much leeway do the robbers get for trying to beat the cops? What I am trying to say is that how close to the spirit of the Cop Q do you have to be. I am close to cracking one but only if I pad the solution with longer then needed variable names. It seems cheap to do so but works within the limitations of the question. I had a look on meta for "What are the guidelines for formulating a Cops and Robbers style challenge?" and this isnt really covered
19:32
@Matt Depends on the CnR in question. What's the cop challenge?
1
A: Cops: Make a regex - Make a snake

TuukkaXPython3, length 162 (Cracked!) Regex: ^([^"' #]){24}"(?1){11}i%n(?1){4}2\*n-(?1){4}i%n(?1){10}i\/n(\)\/\/1)(?1){5}(?2)(?1){3}2\*\(i%n\)(?1){4}[int()2\/]{16}for i in range\(j,(?1){4}\]\)(?1){6}\"\*n\)$ Okay, I know, it's quite long. Fortunately, it won't be cracked in under a week... :'D. I th...

@Matt It really depends on the challenge. The original post should specify exactly what counts as a crack or not. If you pass all of those criteria, it's good. If a valid crack feels cheap, it's either a bad cop or a bad challenge
For example, this crack is completely different than what I originally wrote:
5
A: Anagram Quines (Robbers' Thread)

DennisUnspecified language (CJam), 254 bytes, DJMcMayhem 0000000: 3235 362c 583e 3130 2d5b 445d 2f41 612a 256,X>10-[D]/Aa* 0000010: 3a63 6523 0102 0304 0506 0708 090b 0c0e :ce#............ 0000020: 0f10 1112 1314 1516 1718 191a 1b1c 1d1e ................ 0000030: 1f20 2122 2425 2627 2829 2b2e 3334 ...

My cop wasn't that well hidden
@AdmBorkBork Since you are PowerShelly... its this one: codegolf.stackexchange.com/a/112541/52023
CMC: What user has the highest percentage of their rep from bounties?
I don't know that I've ever received a bounty, so you can count me out right away
Is there somewhere you can see all of your earned bounties?
19:39
Not to my knowledge
I would imagine the person who did the prime checker in Hexagony
I forget the name
Oh yes you can, on your bounties tab in your profile
Huh, I guess I've earned 2 +50 bounties
Twin question: which user has given away the highest percentage of their rep in bounties?
(it might be wheatwizard)
So that's 0.37% of my rep
I've earned 600 from 2, and offered 1650 from 7
19:42
@DJMcMayhem He's offered 27.89% of his current rep as bounties (2500/8963)
I've given away 1400, but some people give away that kind of amount for a single post...
I've only ever offered one bounty :(
it was 250 on that Cubix quine
@ETHproductions whistles
That's crazy
I've only ever earned one bounty, for 50
Martin has given away 7450 and earned 5800
Haha, the two bounties I've ever earned are for the same answer :D
19:46
Oh yeah, that V keyboard one
Yeah, which is also my favorite answer
@Matt Since the score is based on the size of the regex and not the size of the code, I think that would be an acceptable crack. The cops don't necessarily need to golf.
Just for fun, I tried translating it into vim to see how competitive that would be. It was 215, which would beat any other answer except for bubblegum
@AdmBorkBork So its a risk the cops are taking. You want a short regex but in order to make it shorter you risk making it too easy then?
Right. I mean the shortest regex would just be ., but that's insanely easy to crack.
@ETHproductions Dang, and I thought my ~8% was pretty good
19:50
I've earned about 20% of my current rep from a bounty
I've given away ~6%
And earned about ~2%
I have earned no bounties.
@DJMcMayhem There's actually a person that has given away all of their rep via bounties
@AdmBorkBork In time
For me, ~0.37% earned and ~0.92% given away
19:54
@Matt Eh, likely not. I knew coming in to this site that I'd be facing an uphill battle because I golf in PowerShell.
@AdmBorkBork As do I. People give bounties for honorable submissions regardless.
Stolas, The Netherlands
1 4
Did he just give away his association bonus as a bounty?
Yep
Wow... 10000% given away
19:56
25
A: Golfing A Weasel Program

marinusAPL (143) 0{⍵≢T←'METHINKS IT IS LIKE A WEASEL':c∇⍨1+⍺⊣⎕←(⍕⍺),':'c'-- score:',s⊣c←⊃c/⍨G=s←⌈/G←{+/⍵=T}¨c←{⍵{⍵:⍺⋄C[?27]}¨9≠?28/20}¨100⍴⊂⍵}⊃∘(C←27↑⎕A)¨?28/27 Explanation: 0{...}⊃∘(C←27↑⎕A)¨?28/27: set C to the first 27 capital letters. There are only 26, so the 27th element will be a space. Sele...

Taha Akbari, Tabriz, East Azerbaijan, Iran
1 2
@fəˈnɛtɪk ...wait, you're LliwTelracs?
There's another user that gave away their association bonus
@ETHproductions yes
@WheatWizard Maybe to avoid extreme cases, we should limit to it to users with > 1k rep?
19:58
I didn't even change my profile pic
And I thought I had kept up with all the name changes :P
Then its lembik for sure
@fəˈnɛtɪk I just haven't seen your pic very often, and it's especially indistinguishable in chat
"Fanatic"?

« first day (2232 days earlier)      last day (2907 days later) »