« first day (2354 days earlier)      last day (2493 days later) » 

7:00 PM
@Zacharý :P
 
@orlp, no. Do I not have a test case which gives a counterexample? If not, I'll add one.
 
you only have two cases with n = 1
 
I'm tempted to flag for some reason ... won't make a mistake like that again.
 
1 [2 4 10] 6 this is solved by tossing the minimum into every chute
 
Right, on it
 
7:01 PM
1 [3 5 5 5 5 5 5 5 5 5] 5 this one by tossing the maximum into a single one
 
1 [4 5 15] 10
 
alright
that one is similar to 'toss the minimum into every chute' but with some sort realization that throwing one extra allows you to rule out another chute
@PeterTaylor do you have a program that solves it? I have a feeling there is an elegant simple solution but I can't think of it at atm
 
@ConorO'Brien I think it might be better to split functional operator and operator functions into two seperate proposal so to increase the chance at least one will get in :P
 
I have reference solutions in Java, Python, and CJam, although only the CJam one is golfed
 
@PeterTaylor are they big (complex) or fairly simple ones?
 
7:08 PM
@PeterTaylor Well ... yeah, it's Cjam, a golf-lang.
 
There is an elegant solution, but it's tricky to prove it correct.
 
I think there's a condition you can use for a recursive solution in that there is no observable effect of throwing less than the minimal number of balls, so you can throw that number into every chute and recurse on the resulting configuration
that sounds like a combinatoric explosion though, unless there's some dynamic programming substructure
 
Major hint: there's a dynamic programming solution in quadratic time.
 
Hey, I'm wondering if I should start developing my codepage right now.
 
@ConorO'Brien wait if JS don't have operator overload is functional opeartor really useful
 
7:15 PM
also there needs to be more groovy on ppcg
groovy is pretty... groovy
 
@PeterTaylor I just had a really interesting mind experiment reasoning flaw
 
@totallyhuman Dang it, that's MY thing. (because MY is my programming language)
 
'surely the worst case is always throwing the ball in the biggest chute on the first throw'
 
@ConorO'Brien Question: what would happen if you did (+)()
 
'oh - then the algorithm is simple, throw 1 ball in your first choice then always switch after that'
 
7:20 PM
0
A: Sandbox for Proposed Challenges

caird coinheringaahingPlay a game of Flow Flow Free is a game where you have to join different coloured points on a board with a "pipe", in such a way that no pipes cross and that 100% of the board is covered in pipes. Your task is to take an empty Flow board and output the solution to it. Each board is guaranteed on...

 
Allow me to correct myself: it's cubic, not quadratic, in the worst case.
 
Anyone else hate O notation?
 
@Zacharý why?
 
@Downgoat probably an error
@Downgoat not entirely, but we could anticipate overload in the future
 
I just ... do, it just seems so confusing (it's probably not, to be honest)
 
7:30 PM
I hated O notation when they made me work with the mathematical definition in school. Now it's just "oh, that's clearly O(whatever)"
 
@Downgoat agreed
 
The mathematical definition is evil
 
@BusinessCat Yeah, I am a math-oriented person I was going into it thinking ... oh, this should be fine... later: NO NO NO NO NO NO NO NO
 
@PeterTaylor by the way you might want to implement some anti-bruteforce clause into your challenge or else I'm sure someone will iterate over every permutation of chutes and every possible ballthrowing strategy
 
Big O is much nicer when you can look at something and be like "oh, the biggest term is 5x^2 so it's O(n^2)"
 
7:34 PM
(I really wish Comp Sci AB was still a thing, I would've learned something)
 
AP Computer Science AB.
 
@orlp I think that's actually more complicated than some better approaches
And I think that most golfed approaches will be non-polynomial, which makes it hard to write an anti-brute-force clause
I do normally favour them, but I deliberately didn't include one this time
 
I'm trying to reduce the combinatoric explosion at the moment but I'm having a hard time figuring out what I can assume about the worst case
see also my funny flawed thought train above
 
7:40 PM
@Zacharý Category error
 
What?
 
@Zacharý What is your favourite, a banana or solar panels?
6
 
>.<
 
people keep on downvoting codegolf.stackexchange.com/questions/130337/… but no one says why
hi all
 
The time limit seems makes this a chameleon challenge - it becomes more about writing fast code than about writing short code. — Mego Jul 7 at 12:58
That would be my guess
 
7:44 PM
@WheatWizard ok. that comments was a few days ago and the downvotes are current
 
Ok then I don't know.
 
0
A: Fibtraction - Fibonacci but with subtraction

totallyhumanGroovy, 27 bytes f={it<3?it:f(it-2)-f(it-1)} Try it online! Okay, so I feel like I stumbled upon a great language for golfing. This code is basically what most other answers are doing, if n is lesser than 3, then return n or else return f(n - 2) - f(n - 1). But there are a few cool things abo...

 
@WheatWizard it's tricky as I asked about this on codegolf.meta.stackexchange.com/questions/13231/…
and the answer looks clear to me that it's ok how it is
it's almost like people have their own minds :)
maybe I should link to that from the question??
 
My guess new is that people read it, thought it would be easy, did it assuming the time limit would be a non-issue and then realized how hard it was to make a valid answer given the constraint. I feel that the issue of it being a chameleon challenge is mostly that the time constraint is the most important aspect of the challenge but is not stressed as so in the body of your question.
 
@WheatWizard interesting.. so a change of emphasis might help
 
7:50 PM
I think so
 
added a new sentence near the beginning
also added a link to the meta question
 
I would like to try the question but I don't have a "modern desktop" so I would not be able to reasonably test my solution.
 
@WheatWizard I don't think that's right
if you use a suitable algorithm your code will be almost instant
which will be the same on a modern desktop
 
But its codegolf, so a suitable algorithm is not always the best one
 
try orlp's code? It takes < 3ms
@WheatWizard I am not sure there exist algorithms of intermediate speed for this problem
I think you are either very fast or very slow
I did think about this before posing the question :)
I do fear for the prospects of my next challenge which will be the discrete logarithm
ok there is an intermediate speed solution which is to use discrete logarithm... which is bonkers :)
 
8:04 PM
@PeterTaylor I have a solution I believe to be correct but that's too slow for the bigger testcases
 
It has one parameter but the recursive call passes two...
 
@PeterTaylor reload gist, I edited something
(I moved goal out of the recursive call but forgot to remove it there)
actually, after implementing caching now (after noticing I can sort the arrays) I find that it's incorrect on bigger cases
 
0
A: Sandbox for Proposed Challenges

ChristopherMake me some ASCII cities! Your job is to pseudo randomly generate ASCII cities (top down view) with n building per row with x rows. Each house should have a number label starting with 000 and working up. First number is the row (assume x<9) and the other two are places in the row. i.e 000, 001,...

How fast would you VTC that?
tags: code-golf, ascii
 
@PeterTaylor actually that was a minor hiccup, I think I solved it now
 
8:18 PM
The overall structure looks plausible
 
now I need to golf it
 
2733
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 ...

 
Unicode ... why???
℘ = script capital p
 
what's wrong with it
@DJMcMayhem yeah but now we can confirm if downgoat is sheep in disguise
 
@PeterTaylor may we take the pipes in descending order?
 
8:30 PM
> You may also assume that the counts are sorted (ascending or descending), as long as you state that clearly in your answer.
 
oops :)
 
𝒫 = MATHEMATICAL SCRIPT CAPITAL P
 
@Zacharý There are lots of errors in Unicode.
 
Still... how do they mistake a lowercase for an uppercase?!
 
@Zacharý UP TACK: ⊥   APL FUNCTIONAL SYMBOL DOWN TACK UNDERBAR: ⍊
@Zacharý How do they mistake up and down‽
 
8:34 PM
Wow. Just wow. They hate APL. alot.
 
@Zacharý, I'm not sure why you're blaming the Unicode consortium for the implementation of your font provider
 
@PeterTaylor No, Unicode have admitted it was a mistake.
 
welp my meta post failed ;-;
 
And that they won't fix it ... (I get the case of the , but SERIOUSLY WHY NOT CHANGE ?)
 
It looks pretty upper case in most fonts here: fileformat.info/info/unicode/char/1d4ab/fontsupport.htm
 
8:39 PM
There fixed...
 
@Zacharý All the APL tacks are like that. See footnote *** here
@Zacharý On the other hand, there was once a dentist who liked APL a lot. I've not been able to find any info on these glyphs' origin or use.
 
Some dentistry symbols there make sense (the corner ones).
Actually, it's probably coincidence to be honest (very generic symbols)
 
@Zacharý Sure, and some are basic geometric shapes. However, some seem eerily, specific, no?
 
Where does iota even come from to be honest?
 
Lets see if my multi month long sandbox with 1 then 0 score gets closed. (pop con fyi)
 
8:45 PM
@PeterTaylor I posted my answer
 
@Zacharý index, indices, in
 
Oh. Reverse?
 
@Zacharý huh?
 
 
@Zacharý mirror over the axis indicated, just like ⍉ and ⊖
 
8:48 PM
Okay, any explanation as to why unicode considers APL alpha,omega,iota different from the greek versions? Just 'cause?>
 
@Zacharý Probably bacause they are used as APL function and dfn arguments and not greek letters
 
@Zacharý Because they serve different roles from the word characters.
 
you'd want to have a clear distinction for these
 
Okay, I think this is the last one: why the difference between the small membership (GNU IIRC) and normal membership (Dyalog IIRC)
 
I thinks there's also delta
 
8:51 PM
Delta could just be a generic triangle to be honest,
 
@Zacharý Not the APL symbol. It is a word character.
 
@orlp, does functools work for you? I get an error: unhashable type: list
 
@PeterTaylor sorry, my usage section was incorrect
it expects a tuple as input
e.g. S(2, (2, 4, 10))
 
CMC: Write a full program, that when ran will print the current number of moderators on the SE network. (545 right now)
 
8:56 PM
@Zacharý too much APL. too much unbalanced width unicode chars.
 
@DJMcMayhem 545
@Uriel too much APL ‽ Traitor!
 
No, it should print the current number at the time of running it. So running it once more mods are elected it should still show the correct number
 
Only a few are APL actually.
 
anybody know pyth
never mind o worked it out
 
Most are just inspired by APL. The quad and quote quad is input only. The squish quad is just empty array.
 
8:59 PM
:38694150 I think you got it right this time.
@Zacharý Why not ?
 
Thanks ... forgot about that one!
 
-1
Q: Make me some ASCII cities!

ChristopherYour job is to pseudo randomly generate ASCII cities (top down view) with n building per row with x rows. Each house should have a number label starting with 000 and working up. First number is the row (assume x<9) and the other two are places in the row. i.e 000, 001, 002... Every house should v...

 
√ and ¯ are two separate chars.
 
@PeterTaylor I added a small explanation of my algorithm
 
@Zacharý Let me guess: nth root and negative?
 
9:01 PM
@Zacharý for reference, my (partial) codepage: ⍝æЂijξøœßþÿπ¶±¿¤≉√«»⣿⌺♜♒⽂※‼᧻ಠ🦄🤢🛰️⚽🎷𐩓׆
 
No, square root and conjugate. (_ is negative)
 
@Zacharý Uh, J. What is monadic +?
@Uriel Unicorn?
 
@Adám the imaginary unit.
 
wait anybody know pyth?
 
@totallyhuman yup
 
9:03 PM
Stack-based. + is only dyadic (will be when I implement it)
 
@Uriel FN[2,3,12,15,22,25,32)yN
 
@Uriel You choose the glyphs for the entertainment value, right?
 
You should have U+1F595 exit the stack <troll face>
 
@totallyhuman what are you trying to achieve?
 
shouldn't that apply the function y to every n in the list?
 
9:06 PM
@PeterTaylor is that the same algorithm you came up with?
 
@Zacharý Why don't you have a Cap like J? It will push a special null value causing the next dyad to act as a monad, thus giving you a host of available monadic functions, each (possibly) related to its dyadic cousin?
 
It's similar to one of my algorithms, specifically the first one I proved correct.
 
@totallyhuman no, I think that would be My[...] (M for map)
 
@Uriel Nun Hafukha. Nice.
 
I actually conceived it as a minimax tree search, and you skip the max nodes by effectively arguing that they're unnecessary
 
9:08 PM
If I were to make a language that complex, I would spend it on something other than a golf-lang (that's reserved for Jelly)
 
ohh nvm pyth doesn't use commas in lists
 
I've just tried golfing my Python solution and got 152 bytes with no need for lrucache, but it took me several hours of refining my ideas to get to that algorithm
 
@Adám 🛰️ is currently supposed to reflect part of the code on another part of it, when the code is wrapped around an elliptic surface, based on some solar and lunar calculations.
 
@Zacharý How does it make the language any more complex? Just push 234154236526432.5431652753865375e531 and use that as special value.
 
9:11 PM
What if someone WANTS 234154236526432.5431652753865375e531?
It's my first attempt full at a language, so I'm keeping it like it is, pretty much no syntax/special stuff.
 
@Zacharý Can't you just use null or NaN?
@Zacharý Fair enough. It is YOUR language after all.
 
@PeterTaylor my solution isn't particularly golfed, although the solution isn't particularly nice to golf in Python either
 
0
Q: Create unique ids

Wheat WizardYou are to write a program that takes a list of strings as input. For every string in the list you are to determine the smallest N such that no other string in the list begins with the same N characters as the string in question. Now compose a new list with all these strings. Here is an exampl...

 
@Zacharý Let me know if you want glyph inspiration.
 
@Adám ⌶ ⌷ ⌸ ⌹ ⌺ ⌻ ⌼ ⌽ ⌾ ⌿ ⍀ ⍁ ⍂ ⍃ ⍄ ⍅ ⍆ ⍇ ⍈ ⍉ ⍊ ⍋ ⍌ ⍍ ⍎ ⍏ ⍐ ⍑ ⍒ ⍓ ⍔ ⍕ ⍖ ⍗ ⍘ ⍙ ⍚ ⍛ ⍜ ⍝ ⍞ ⍟ ⍠ ⍡ ⍢ ⍣ ⍤ ⍥ ⍦ ⍧ ⍨ ⍩ ⍪ ⍫ ⍬ ⍭ ⍮ ⍯ ⍰ ?
 
9:16 PM
@Uriel Yes sir! Actually, what?
 
Basically none of those are used in APL ... that's the sad part.
APL portion of Miscellaneous Technical Unicode block.
 
@Zacharý Why is it sad. MY doesn't have to look like APL. What do you e.g. plan for sort up and down?
@Zacharý There is actually a way to ask APL which symbols it knows about (even secret experimental things!), but I'm not allowed to tell you.
 
@PeterTaylor regardless of how golfable or optimal my algorithm is, I'm pretty happy I did solve it :)
 
⍋⍏⍒⍖ are for sorting.
 
is this a well-known problem?
 
9:19 PM
(Time to brute force everything in APL ... wow)
 
@Zacharý ⍒⍋ are for grading. Why not ∇∆ for sorting?
 
∆ for increments.
 
@Zacharý Ah. I've proposed <> for sorting. Alternatively ∨∧.
 
@Adám why? you can just index after ⍋
 
9:21 PM
Because code golf.
 
@Uriel materialize?
 
One use of squish-quad (I think that's OO or something...)
 
@Zacharý Shhh!
@Zacharý Right, but what does Uriel mean? Indexing (dyadic )?
 
@orlp I think your solution is 201 bytes, not 198
 
@Adám What? Do they NOT know you probably will use it for golf?
And doesn't work with array indexes, does it?
 
9:23 PM
@Zacharý They do.
@Zacharý It does. But if you want to sort anything you have to be clever.
 
They're even having a dang workshop for it at Dyalog '17.
 
@Adám sorry, meant like k[⍋k]
 
@Mr.Xcoder you forgot the tab <> spaces trick in Python
those 4 spaces are 1 tab
 
@Zacharý Yes, and I didn't even have anything to do with that suggestion. Honest!
 
But ... of course you're going to be in it.
 
9:25 PM
@Uriel Won't work neither on matrices, nor on vectors of vectors.
@Zacharý Yes. Orders. I had no influence on that either.
 
@Adám how do you even define sorting matrices?
 
@Uriel Lexicographically: {⍵[⍋⍵;]}
 
APL-style. Rows. Columns. etc.
@Adám That definitely was indirect influence, considering ... PPCG
 
@Zacharý Stefano and Nick were here long before me.
 
@Adám and morten did some SO
 
9:30 PM
@Uriel Oh, on SO there are a bunch of APLers.
 
I was referring to you participating in the workshop.
 
@Zacharý Oh, ok. Yeah. Wonder what we'll do…
 
Wait ... did Stefano work for Dyalog?
 
@orlp I don't think so. As mentioned in the sandbox post, it's an anonymised version of a question which seems to be from an Amazon interview a couple of years ago, but I could find barely anything using the phrasing of the Amazon version
 
@Adám and most of their answers looks like dyalog promotional
 
9:32 PM
v16 stuff. (I've been to the page for '17 workshops)
 
@Zacharý Yes, long ago. He's with APL (Italiana) now.
 
No wonder he beat Dan B. by one byte in the year game last year.
 
@Zacharý Oh. I didn't look. Interesting though. Dan brute forced.
I don't know if Stefano also did, but I know that quite a few of us did.
 
I have a feeling Jonas Stensiö and Veli-Matti Jantunen brute-forced as well (tied for first).
 
@Zacharý They cheated. Finns!
 
9:37 PM
Is that like an inside joke or something?
Who would want to cheat, and rob Dan of his posthumous win?
 
@Zacharý No. They didn't know how Dan would fare. Also, they did cheat. They got results which looked correct, but were character vectors instead of numeric arrays. That was against the spec from the beginning.
 
(I was referring to the "Finns!")
 
@orlp I figured that out in the meanwhile
But I am too tired
It's 12:40 AM here
Bye
 
@Zacharý Oh, that's just a joke on both being Finnish. Not inside anything. Possibly Nordic humor.
 
@Adám so are they Finns or Finnish? or is Finnish an adjective for Finns?
 
9:43 PM
@Uriel They have Finnish nationality, so they are Finns. Just like I'm a Dane because I'm Danish. And Swedes are Swedish citizens.
 
@Adám Denmark. Canada. UK. Anywhere else?
 
@Adám but Dan was also Dan-ish and he wasn't a Dane.
 
@Uriel Does this have to do with APL or what? (the puns)
 
@Uriel He wasn't Dan-ish, he was just Dan. Daniel, actually. His family always called him Daniel. He did live in Denmark though, and learned some Danish.
 
@Zacharý no, he was Danish as you are Zacharish
 
9:45 PM
@Uriel I even noted "(the puns)"
 
@Uriel But I am an Adam (aval ani adam echad)
His wife and daughter visited me in London a couple of days ago. And today we looked at an old bug report that Dan had filed, and needed to ask what exactly he meant. Miss him. ⊥⍨
 
@Adám May he rest in peace.
 
^
 
@Zacharý Name change?
 
@Adám btw, wasn't his memorial challenge the first one?
 
9:53 PM
@Mr.Xcoder ‽ (had that on clipboard)
 
@Zacharý You changed username.
 
Oh. Yeah, I changed my username.
 
@Uriel the first what?
 
first memorial challenge
 
9:54 PM
I'm super excited about this sandboxed post. Does anyone have thoughts on it?
 
@Uriel Are there more?
 
@Uriel Are you referring to the first memorial being the challenge?
 
@Uriel Oh. Possibly.
 
Oh, the first memorial challenge being posted on PPCG.
Grrr. English ambiguity.
 
9:57 PM
@Zacharý Sure, a dyadic function that doesn't use its arguments, but just returns a constant value. What's wrong?
 
1
A: Sandbox for Proposed Challenges

DJMcMayhemMake your language mostly unusable cops-and-robbers arithmetic Inspired by this comment... In this challenge, you are tasked with running some code that makes it so that your language no longer satisfies our criteria of being a programming language. In that challenge, that means making it so...

 
The fact that no spaces are needed between the interrobang and the arguments.
 
@DJMcMayhem looks good, but this can have really complicated workarounds for some languages
 
I would expect it to think ‽2 was a variable.
 
@Uriel So... That's good for cops? Or good for robbers? I'm slightly worried that it'll be too hard to get a safe cops answer.
 

« first day (2354 days earlier)      last day (2493 days later) »