« first day (1840 days earlier)      last day (3003 days later) » 

Anonymous
8:00 PM
The lazy challenge author
 
oh what a serious-looking challenge writer
we might have a new calvin here
 
still 9.9
 
Anonymous
She will be the next Calvin... after her nap
 
Anonymous
 
8:02 PM
@Optimizer status-norepro
 
you troll
 
Anonymous
@Optimizer shoop da whooop
 
I knew that was fake the moment I saw it because it should be 10.0
 
Anonymous
^
 
Anonymous
But seriously tho
 
Anonymous
8:04 PM
 
lol okay
 
> Okay
 
> Okay
Dammit
 
see my updated one
 
haha
 
Anonymous
8:04 PM
They're never satisfied
 
@Mego haha
 
> 10.0 questions per day. Okay. Fuck you, Code Golf.
 
I guess this makes us the smart-asses of SE.
> literally impossible to do 10 Qs/day
> does it anyways
> will rub in SE's face
 
Commense rubbing ( ͡° ͜ʖ ͡°)
2
 
Anonymous
8:05 PM
 
ayyyyyyyyyyy ¯\_( ͡ಠ ͜ʖ ͡ಠ)_/¯
 
@Mego Niiiice.
 
When you sign up for the wrong exam timeslot and have to study a whole semester worth of stuff in like 50h...
 
@El'endiaStarman I haven't seen this oscillator before.
What is it?
 
@mınxomaτ O___O Good luck!
I know you can do it though :D
 
8:06 PM
@quartata Uses two different rules. Link.
 
@AlexA. ( ͡ ° ͜ʖ ͡ °)
 
@mınxomaτ yeah good luck!
 
Anonymous
@mınxomaτ 2+2=4
 
Gif was created using the brand-new "Render to gif" feature! :D
 
you know what? its gonna stay 9.9 till 2020 now
 
8:07 PM
cool!
 
@quartata ( ͡ ° ͜ʖ ͡ °)
Oh god Lenny in monospace looks horrific
 
( ͡ ͡ ͡ ͡ ° ͜ʖ ͡ ͡ ͡ ͡ °)
wat
I think I might have done that wrong
 
> might
 
Anonymous
TBH we'll probably graduate on June 8th
 
Anonymous
They'll make us wait for our 6th anniversary
 
8:08 PM
@AlexA. I did the math. All the lectures (are available digitally) take about 30h to listen to. So 20h to learn...
 
@Mego April 1 would be awesome though
"ha, nice try... WAIT WHAT"
 
@mınxomaτ Your lectures are available digitally?
 
Anonymous
@Doorknob It won't help with the "PPCG isn't a serious site" comments :P
 
That's cool.
 
@quartata Yes. All of them.
 
8:08 PM
@Doorknob No one would believe that we graduated until we got a design
 
Anonymous
The April Fools prank for us will probably be attaching a second beta tag
 
@Mego "early alpha"
 
haha
 
Anonymous
"early access"
 
Programming Puzzles & Code Golf beta beta
 
8:10 PM
Programming Puzzles & Code Golf Gamma
 
Brogramming Euzzles & Tode Aolf
 
"Congratulations for making it through beta! Unfortunately you're not quite at version 1.0 yet. Maybe in a decade or so."
 
Dancing quartata.
2
 
hahaha
 
8:14 PM
That feeling when you beat your head against the code for 15+ minutes, and are just about to post your lengthy answer, when you realize an alternate method that cuts your code in half and type that up in a minute ... :-/
 
Anonymous
That feeling when you're still at 9.9 q/day
 
That feeling when you're still at 9.9 q/day and everyone is chatting instead of posting a question already
I'm gonna have to freeze the chatroom until someone finally gets around to doing it :P
 
Taking suggestions for a background and/or better title here.
 
Anonymous
Wow do we not have a congruency challenge?
 
O_o
 
8:19 PM
 
> Brogramming
 
@PhiNotPi: ^
 
Anonymous
Posted a challenge
 
> Built-in congruence testing methods are forbidden
NOOOOOOOOOOOOOOOOOOOOO......
Minkolang has one...
 
Hahaha
 
Anonymous
8:27 PM
They would trivialize the challenge :P
 
Guys help
what is the shortest representation of a binary fractional number in [0, 1)?
 
...how do you mean?
 
well, the problem is that it can't just be a list of digits
 
Um, wouldn't that be infinity in some cases?
 
no, the number is a binary fractional number, that's finite
let's say I have the binary number 0.101
a trailing zero does nothing
0.101 == 0.1010
so if you were to store the binary fractional numbers as a sequence of bits, you're wasting space
 
8:30 PM
( ͡ ͡ ͡ ͡ ° ͜ʖ ͡° ͡ ͡ ͡ )
 
0
A: Sandbox for Proposed Challenges

Cᴏɴᴏʀ O'BʀɪᴇɴMaximum median? That's just mean! Objective You are to write a program/function/whatever that takes five numbers as input/function argument/wrapped in an array/etc, and find the least possible value in a set that satisfies the following properties: The set has a mean (average) of A (input 1) T...

 
[1, 0, 1, 0] is not a 'valid' sequence of bits to store a binary fractional number
 
@Mego How about gcd and lcm?
 
nor is [1, 0, 1, 0, 0]
because those all mean the same as [1, 0, 1] if you're using the naive encoding scheme
 
8:30 PM
*reversing the bits in the number
 
so I wonder, how should you do it?
@CᴏɴᴏʀO'Bʀɪᴇɴ that has the same problem, just reversed
[0, 0, 1, 0, 1] is not valid
 
Sorry, was bit vague
 
3
Q: Congruence Relations

MegoGiven 3 positive integers a, b, and n (whose maximum values are the maximum representable integer value in your language), output a truthy value if a ≡ b (mod n), and falsey otherwise. For those unfamiliar with congruency relations, a ≡ b (mod n) is true iff a mod n = b mod n (or, equivalently, (...

 
Reverse, parse as binary number (remove leading numbers), reverse again
 
I don't get it
 
8:33 PM
[1,0,1,0,0] => [0,0,1,0,1] => (parse) 101 (unparse) [1,0,1] => reverse [1,0,1]
 
in that system [1, 0, 1, 0, 0] means the same as [0, 0, 0, 1, 0, 1, 0, 0]
 
2 mins ago, by orlp
@CᴏɴᴏʀO'Bʀɪᴇɴ that has the same problem, just reversed
^^
 
I have a different idea
 
8:34 PM
yeah?
 
is that you assume every number ends in a 1
so [1, 0] actually means 0.101
that works, except for one number: 0
 
That's brilliant
oh
How about an empty list implies zero?
 
then how would you encode 0.1?
 
now, you could make 0 mean 0.0
then if the number is above 0, you do the above coding scheme on n-1
but that's not as elegant
 
8:37 PM
true, but it works
How about this pseudocode:
bitparse (x) {
  while(!peek x) pop x
  ret x
}
 
I don't know what that is
or what it's supposed to mean
 
x is a list of bits, peek means the top element of x, and pop x means remove the top element
 
could you do it in Python instead of your pseudocode?
 
Yeah, gimme a sec
 
The five answers so far on Mego's congruency challenge were posted in descending order by byte count and ascending order by time. :P
 
8:41 PM
>>> def bit_parse(x):
...     while not x[len(x)-1]:
...             x.pop()
...     return x
...
>>> bit_parse([1,0,1,0,0])
[1, 0, 1]
>>>
 
I don't see how that solves anything
 
Anonymous
@CᴏɴᴏʀO'Bʀɪᴇɴ What is this nonsense? x[-1]
 
@Mego This actually took me months to figure out haha
 
@orlp How doesn't it? :/
 
@CᴏɴᴏʀO'Bʀɪᴇɴ ok, let's change the function signature a bit
 
8:44 PM
what's a function signature?
sorry
 
input/output specification
I'll give you a list of binary digits that form a binary fractional number
in this list, [0, 1, 0] means the same as [0, 1], because trailing zeroes don't matter
in return, you give me a list of bits such that every bit always matters
if I can give you two lists that mean the same thing when decoded, you've failed, because then you're wasting bits on redundant information
 
Oh, so an encoding scheme in which every list is unambiguous?
 
Anonymous
Sounds like a good programming puzzle to disguise as a CnR
 
@CᴏɴᴏʀO'Bʀɪᴇɴ stronger
unambiguous means that you can always decode it
I'm talking a 1-1 mapping between binary fractionary numbers and bits
 
That's what I meant, sorry.
 
Anonymous
8:47 PM
So an isomorphism
 
Anonymous
 
Anonymous
Writing that last challenge made her pass out
 
nice pussy
 
Lol
 
8:49 PM
How many questions per day at we at?
 
Area 51 says 9.9 right now, but it hit 10 earlier.
 
Anonymous
@El'endiaStarman
 
\0/
o-)
 
@Mego .......@Optimizer, you troll!
I didn't read carefully enough... ;_;
 
8:50 PM
I could post this, if no-one has comments on it:
1
A: Sandbox for Proposed Challenges

ZgarbParse nested digit-lead strings code-golf string parsing The task A string S is constructed with the following process: Start with S being the empty string. Insert at some position of S a string of the form ds, where d is a nonzero digit and s is a string of d lowercase ASCII letters. We s...

 
Anonymous
@El'endiaStarman :D
 
(and if someone can verify the test cases, I did them by hand...)
 
Anonymous
@Zgarb I'm not of sound enough mind currently to tell whether that makes sense :P
 
Anonymous
I have a floofy kitty curled up next to me that is stealing my brainpower
 
is the output unique?
oh, yes it is
 
8:52 PM
@xnor It should be. You can obtain the constituents by repeatedly removing the ones that don't have others nested in them.
 
i feel like we've had similar stack parsing challenges
don't remember this though
 
hrm
this problem isn't actually limited to fractional binary numbers though
 
think of how you would encode an arbitrarily sized integer in bits
you know that the first bit will never be 0
 
Anonymous
Isn't that basically Huffman coding?
 
8:56 PM
I don't believe so?
 
Anonymous
Or, at least, strongly related to Huffman coding
 
hrm
 
@Zgarb someone might ask whether you can print each constituent on its own line
 
if "" means 0
 
@Zgarb i'd assume no based on the concatenation requirement
 
8:58 PM
@xnor That's correct, I'll clarify.
Done. I also went through our challenges, and didn't find duplicates.
 
ok, cool
looks like another solid Zgarb challenge
 
@xnor @Zgarb it's confusing when you two talk because you have similar avatars :|
 
And they both like math. :P
 
and write good challenges
 
The question is: which one's the sock?
Dun dun dunn
 
9:08 PM
Trick question; @CᴏɴᴏʀO'Bʀɪᴇɴ === Sock
 
7
A: Sandbox for Proposed Challenges

RikerWI can't believe it's not a Platypus!!! This is an image of our wonderful pet platypus @Cyoce. This is also an image of the same person, or is it? (hint: it isn't) Your task is to determine whether a inputted image is @Cyoce in disguise... The input may be taken in any form. It will also...

 
xsot is my sock
come on, I wasn't even trying with the name
 
Ayy memification ¯\_( ͡ಠ ͜ʖ ͡ಠ)_/¯ ¯\_( ͡ಠ ͜ʖ ͡ಠ)_/¯
 
Can somebody help with test cases?
@CᴏɴᴏʀO'Bʀɪᴇɴ you were also semi-memeified.
 
@Cyoce Of course, I'm too smart for normalcy :P
@RikerW really?
oh, cool!
 
9:09 PM
I needed something that was definitely not a platypus.
And you are my friends. :P
 
> If the image is not within 1000 units of the profile picture, you must output the phrase "I can't believe it's not Büttner!!!" exactly
 
Why Büttner?
What is all this residual martin?
 
Bc it used to be martin and a I can't belive it's not butter box.
butter->büttner
 
But it isn't about Büttner anymore ( ͡° ͜ʖ ͡°)
 
9:14 PM
Correct.
 
This one's fun to watch.
 
Well, it's a challenge now.
 
Period of 62.
 
0
Q: Bijective mapping from integers to a variable number of bits

orlpA variable number of bits is an array of 0 or more bits. So [0, 1] is a variable number of bits, but so is []. Write a function or program that, given an nonnegative integer returns a variable number of bits such that every integer has a one-to-one (bijective) mapping with an array. There are a...

Good luck!
 
Ayyy 900 rep! ¯\_(ツ)_/¯

@CᴏɴᴏʀO'Bʀɪᴇɴ I'm coming for you ( ͡° ͜ʖ ͡°)
 
9:16 PM
pls halp i need test cases i try for ≥8 wek but no case
 
So I have to not be lazy and make my own test cases? :(
 
3
Q: Parse nested digit-lead strings

ZgarbThe task A string S is constructed with the following process: Start with S being the empty string. Insert at some position of S a string of the form ds, where d is a nonzero digit and s is a string of d lowercase ASCII letters. We say ds is a constituent of S. Go to step 2 or stop. Your tas...

2
Q: Bijective mapping from integers to a variable number of bits

orlpA variable number of bits is an array of 0 or more bits. So [0, 1] is a variable number of bits, but so is []. Write a function or program that, given an nonnegative integer returns a variable number of bits such that every integer has a one-to-one (bijective) mapping with an array. There are a...

 
Yes ¯\_( ͡ಠ ͜ʖ ͡ಠ)_/¯ ¯\_( ͡ಠ ͜ʖ ͡ಠ)_/¯
 
still at 9.9
 
9:18 PM
: (
 
blame caching
 
0
A: Sandbox for Proposed Challenges

Cᴏɴᴏʀ O'BʀɪᴇɴMaximum median? That's just mean! Objective You are to write a program/function/whatever that takes five numbers as input/function argument/wrapped in an array/etc, and find the least possible value in a set that satisfies the following properties: The set has a mean (average) of A (input 1) T...

 
why can't they have that clear cache button explain xkcd does...
 
because hard refreshes exist
 
cmd-r isn't helping....
 
9:20 PM
 
^
 
but... caching
or maybe some questions just became older than 2 weeks
 
idk
GIMMME DEEZ 10S
@CᴏɴᴏʀO'Bʀɪᴇɴ > find the least possible value in a set that satisfies the following properties:
> The set has a mean (average) of A (input 1)
you are being contradicotry.
You say value in set, and then say set...
 
I think you mean just set.
 
9:23 PM
No.
Find the least value in that set.
 
Oh, okay.
I get it now.
 
2
Lovers & couples

Proposed Q&A site for professional relationship counselors and couple therapists

Currently in definition.

Read the bottom example question.
No wonder it got 6 downvotes.
We need to say more good things about nethack so marky learns them.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ you mean a well-ordered set I presume? :P
 
9:28 PM
@quartata ?
oh yeah
That's implied whenever one talks about median .
 
Somebody VTC that question?
@CᴏɴᴏʀO'Bʀɪᴇɴ ^
 
@RikerW They need to post a preliminary question: How do I convince my SO to swallow?
 
> meadian
 
@RikerW I did.
 
@Fatalize um, okay.......
 
Anonymous
9:29 PM
@Fatalize My Stack Overflow claims to not have enough room to swallow
 
Sequence identification challenge! 0, 2, 0, 6, 4, 14, 0, 14, 12, 62, 8
 
This one made me laugh too
 
@Mego So, it ... umm ... overflowed?
 
Anonymous
@El'endiaStarman no
 
@El'endiaStarman nothing in oeis
 
9:32 PM
lol :P
@orlp Yes, I know. Figured I'd pose it to you guys for the fun of it. :P
 
it's 100% something to do with powers of 2
 
IDK
 
I'm working on Sandboxing the challenge this is becoming.
 
Anonymous
Can anyone else offer input on this?
 
Anonymous
@Mego: You don't need to know Haskell. You just need to know the word "polymorphic" (accepting many types) and to understand that there exist numbers which nobody would have ever provided as realistic inputs to the function (in this case, numbers with the type of unsigned bytes) which cannot be subtracted without causing a numeric overflow that generates incorrectness. Your reading of an apparently-unrelated meta-post in strict "rules lawyer" mode would say that they need to accept a byte penalty to restrict the types that their function can be used in. Is that your intention? — CR Drost 2 mins ago
 
9:34 PM
LOG_2(X+1): 1, 2, 1, 3, 2.584962500721156, 4, 1, 4, 3.8073549220576037, 6, 3.3219280948873626
@Mego wat
brain dies
 
@El'endiaStarman hmm
     0
    10
     0
   110
   100
  1110
     0
  1110
  1100
111110
  1000
 
Anonymous
@CᴏɴᴏʀO'Bʀɪᴇɴ Read the whole comment chain
 
0
A: Sandbox for Proposed Challenges

TimmyDSideways Alphabet (title suggestions welcome) code-golf kolmogorov-complexity Write a program or function that outputs or returns this exact string. Alternating capitalization (as shown) must be preserved. Leading whitespace as shown is required. Each line cannot have trailing whitespace. A sin...

 
@Mego wall of text
 
@RikerW Spritz it!
 
9:35 PM
um?
wat?
 
@Doorknob the pattern 10 / 110,100 / 1110,1100,1000 is certainly suspicious
 
1
Cricket Fanatics

Proposed Q&A site for site for cricket lovers ... Let's begin

Closed before being launched.

 
but then there's the 1*0s thrown in there
 
I though that was actually crickets the animal.
 
9:36 PM
^^ me too
 
@El'endiaStarman Does the sequence continue 0, 2, 0, 6, 4, 14, 0, 14, 12, 62, 8, 0, 30, 28, 254, 24, 16, 0?
 
@Doorknob Lemme check.
 
@Doorknob Ah, nice.
 
@Doorknob Nope, 126 comes after 62, 8.
 
@Mego the gist seems to be this: Some existing answers (like the Haskell one) are polymorphic, so they can take both 32-bit ints and arbitrary-sized bignums as inputs. They will fail for some int inputs. Should they be forced to explicitly restrict their input types to bignums?
 
9:42 PM
I liked puzzling better when it was still Q&A.
 
Then 28.
 
      0
     10
      0
    110
    100
   1110
      0
   1110
   1100
 111110
   1000
1111110
  11100
  11110
hm
 
0 0 0 0 1 0 0 0 1 0 1 - the sequence which describes the non powers of two
 
^^
 
Then 30.
 
9:42 PM
hey @DigitalTrauma
Talk to marky
 
      0  0 1  (or 0 0)
     10  1 1
      0  0 1  (or 0 0)
    110  2 1
    100  1 2
   1110  3 1
      0  0 1  (or 0 0)
   1110  3 1
   1100  2 2
 111110  5 1
   1000  1 3
1111110  6 1
  11100  3 2
  11110  4 1
      0  0 1  (or 0 0)
  11110  4 1
labeled by runs of 1s, runs of 0s
 
@RikerW I'm talking
 
Huh, that is curious. There are no 0s between 1s.
Next one is 0.
One thing's for sure, if it's of the form 2^n-1, the result is 0.
 
merp
 
Next one's 30.
 
9:48 PM
number of zeroes follows a pattern: [0]/10/12/10/12/13/12/10/1[...]
 
@El'endiaStarman can we get a list so far?
 
@orlp this
 
Yes, but more numbers have been added.
And I want it in decimal :)
 
He's got them.
 
and I've edited my message
 
9:49 PM
Oh, haha.
 
I'll add decimal
 
just as an array
[10, 42, balbala]
 
Well, gimme a few minutes to get n=17 through n=20.
 
@El'endiaStarman it's an intensive sequence?
or just doing em by hand?
 
1 0
2 2
3 0
4 6
5 4
6 14
7 0
8 14
9 12
10 62
11 8
12 126
13 28
14 30
15 0
16 30
17 28
It's kinda by hand.
 
9:50 PM
I said goldfish, marky said thanks. wth? :P
 
It's a "physical" phenomenon.
 
[0, 2, 0, 6, 4, 14, 0, 14, 12, 62, 8, 126, 28, 30, 0, 30, 28]
 
note the pattern in the number of zeroes
1, 121, 1213121, 12... (separated by 0s)
number of ones is still a mystery
 
18 1022
19 24
20 126
 
brb
 
9:56 PM
0              0  0 0
2             10  1 1
0              0  0 0
6            110  2 1
4            100  1 2
14          1110  3 1
0              0  0 0
14          1110  3 1
12          1100  2 2
62        111110  5 1
8           1000  1 3
126      1111110  6 1
28         11100  3 2
30         11110  4 1
0              0  0 0
30         11110  4 1
28         11100  3 2
1022  1111111110  9 1
24         11000  2 3
126      1111110  6 1
so the next one better be something times 2⁴ or else my pattern's shot :P
 
hahaha :P
 
Your 0s certainly seem to be Sierpinski-ing
 
user image
21
 
!!!!!!!!!
 
First time I've experienced that on this site
 
9:58 PM
Next one's 124.
 
...
okay, well there's still a pattern
 
holy shit we've done it for real
 
My heart is beating omfg
 
@Doorknob WOOHOO
 
HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA‌​HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
 
9:59 PM
Hahaha
 
take THAT SE!
 
@Doorknob maybe it'll be 121312141213121
 

« first day (1840 days earlier)      last day (3003 days later) »