« first day (1897 days earlier)      last day (2933 days later) » 

Anonymous
3:00 AM
@ChrisJester-Young So you could still send in a (well-formed) POST request and it'd work?
 
@ChrisJester-Young How could I make a fixed-sized list in Racket? I want to make an 80x24 grid
 
@Mego Yes.
@quartata (make-vector (* 80 24))
 
Anonymous
Unintuitive doesn't begin to describe that
 
@ChrisJester-Young Oh, well that was easy lol
 
@quartata You can also use make-list but that's nonsensical because: 1. Racket lists are immutable, and 2. Lists are not random-access, and the kind of grid you're talking about sounds like you want random access. ;-)
 
3:02 AM
Do they not have matrices? I could do a vector of vectors I suppose.
 
@quartata if you find vectors too slow, this might be faster (using typed racket) docs.racket-lang.org/math/array.html
 
@quartata Yes, it's called array.
@quartata But I usually just use ny+x indexing myself (one-dimensional vector).
 
@ChrisJester-Young Yeah, that works
 
@quartata Either use one-dimensional vector or use an array; don't do jagged arrays (vector-of-vector).
 
Yikes, arrays look slow.
I'll just roll with a one-dimensional vector.
 
3:04 AM
@ChrisJester-Young I learned that the hard way
 
@quartata Cool.
@Winny Yeah, it's an important lesson.
 
Why is C++ so insanely popular in Code Jam? I'm not saying it's a bad choice, but it's not the trend I perceive outside that competition.
 
So you can use λ instead of lambda? Oooh pretty unicode
 
Not that popular.
 
@Mego wow totally brute forceable
 
Anonymous
3:13 AM
@Dennis C++ used to be the #1 language in the world for software development. It's still extremely popular because it has an extremely long tail due to the sheer quantity of code that needs maintaining, and because it gets regular updates to stay modern.
 
Anonymous
@Maltysen The large one isn't.
 
oh
are you doing an actual answer for that?
 
@quartata yes, and it's 4 bytes shorter so it's a easy win for golfing
 
@Dennis That's because C++ is an awesome language. :-D
 
Anonymous
@Maltysen Yeah, the large one is too big to brute-force, even with 24 hours.
 
3:15 AM
@Dennis A lot of competitive programming people I know use C++, although that's largely because Python wasn't allowed in the competition we had until last year (although some still prefer C++ because of the time limits for problems)
 
Ah, time limits would certainly be a good reason to prefer C++ over, say, Python.
 
Anonymous
Unless you have pypy :P
 
^
 
Pypy is good, but not magical.
 
PyPy's good, but it's not always faster though
ninja'd
 
3:17 AM
Hello again
 
Anonymous
PyPy isn't magical but it's damn close
 
@Mego Opinions on the newlines/indents rule? I'm having trouble deciding
 
Anonymous
@Sp3000 I think it's considerably better than the original. It's not worth a close vote, but possible a downvote.
 
@QPaysTaxes Given up lol
@QPaysTaxes My thread is on hold also
 
@KennyLau I see you commented on Phi's cop - does I/O still need to be revealed with the new rules?
 
3:22 AM
@Sp3000 I guess not... it's on hold though
 
@Mego No examples is fine, but then it just means any submission that produces any OEIS sequence would count right?
 
@QPaysTaxes Didn't see nothing
 
Anonymous
@Sp3000 Either that, or no submission would. It's not clear, hence why I haven't voted to reopen.
 
@QPaysTaxes lol
 
@KennyLau The idea of on hold is just to stop the question from receiving answers while it's being improved. If you clarify the question well enough, reopen votes will come.
 
3:23 AM
@Sp3000 What do you think? How many characters should be revealed?
@Mego I said it clear and loud.
@Mego "However, any proposed source code that produces the same set of output also counts as valid (you are encouraged to reproduce an actual sequence in the OEIS)."
Apparently nobody ever reads this
I should put it in bold.
 
@Mego I'd consider the empty sequence to be a subsequence of any sequence, maybe it's just me
 
@ChrisJester-Young Thanks! :)
 
@KennyLau I did read it, but I only asked the question to make sure I'd understood that sentence correctly :P
 
Anonymous
@KennyLau I read it, but it's not clear whether empty output would match all or none. Just add a minimum of one example, and it's all good.
 
how well do you need to do on gcj to qualify?
 
3:25 AM
Examples help, yeah
 
Anonymous
@Maltysen 30 points
 
@Maltysen See questions, 30 points for qualifier
 
@ChrisJester-Young Which is preferred usually, (for or (for-each?
 
@mego done
 
@Mego \o/ at 25
 
3:25 AM
@AlexA. You've had the same girlfriend for seven years, right? I'd say that's plenty enough to count.
 
@Maltysen Get 30 in smalls just to be safe, in case you mess up large
 
@quartata If you're writing standard Scheme, for-each is your only option. If you're writing Racket, I'd prefer for.
 
@Sp3000 Anything more unclear?
 
@El'endiaStarman However long from when we were 18 to now is, yeah
 
Peeps, how many characters should be revealed?
 
3:26 AM
@Dennis I had actually originally envisioned it as something that programmers would tell their significant others, but the responses I've gotten have been from the other direction, so to speak, which is valuable also.
 
Anonymous
@Maltysen I'm also at 25. I'm waiting for my brain to process B well enough to get the last few.
 
@Sp3000 wait so they take away your points if you mess up larges?
 
@Maltysen Yep
 
@KennyLau min(program_length/5, 25)
 
The points for large are applied assuming you get it right, then taken away if you don't
 
3:27 AM
@NathanMerrill okay.
 
@El'endiaStarman Yes that's 7. I'm bad at math. ._.
 
wait no
that's the wrong answer
 
Anonymous
@AlexA. Isn't your degree in math?
 
@QPaysTaxes Hah, thanks
 
@ChrisJester-Young OK.
 
3:27 AM
min(4*program_length/5, 25) should be hidden
 
@Mego ...yes... >_>
 
@NathanMerrill Which one?
 
@KennyLau It's looking better atm, but just to nitpick: if a code has a line that starts with space but it's not used for indentation (e.g. if it's in a multiline string), does that mean I don't have to reveal it?
 
the latter
 
Anonymous
Or is it statistics, aka fake math?
 
3:28 AM
@Mego small I'm just gonna use NetworkX to make a directed graph with all edges len 1 and shortest path len
 
@NathanMerrill So if I have a code 10 bytes long, I can hide every?
 
@QPaysTaxes .oO(I'm married 9 years, lol.)
 
@Mego ಠ_ಠ My BS is in math with a minor in stats. My master's will be in applied stats.
 
my bad
 
maybe he meant 0.8*program length
 
3:28 AM
yeah
0.8
so, a 10 char program hides 8
but a 100 char program only hides 25
 
@QPaysTaxes I'm a comparatively young fart.
 
encourage golfing
 
Anonymous
@AlexA. So a BS in math with a minor in BS, and then a MS in MS Excel
 
@NathanMerrill okay, good
 
@Mego what in what now
 
3:30 AM
@AlexA. he's saying that stats is BS
 
@KennyLau are robbers allow to fill spaces with noops?
 
D: why do i keep getting a wrong
 
Anonymous
There's a saying my software engineering professor liked to use
 
@ChrisJester-Young Me too. :)
 
Anonymous
3:31 AM
BS = bullshit, MS = more shit, PHD = piled high and deep
 
@Mego lal
I haven't heard the ones for MS and PhD
 
@Mego Thankfully my degree is a BSc. ;-)
 
Probably the most irrational decision I've ever made.
 
@Mego Higher and Deeper :P
 
@Mego I didn't have a romantic relationship until I was 20...and I'm still in it, 3 years later. :D
 
3:32 AM
@QPaysTaxes ok
 
@ChrisJester-Young Technically mine is too, it just depends on whether you spell "realize" with an s or a z that you call it a BS or a BSc. :P
 
@QPaysTaxes no way
 
@AlexA. Exactly!
 
@QPaysTaxes noted
 
its up to the cops to force a sequence
 
3:32 AM
@El'endiaStarman so basically there's a small chance that I won't be a loner forever. :)
 
@El'endiaStarman My first and only romantic relationship started when I was 25.
 
Anonymous
@Maltysen Or you could adopt cats get adopted by cats
 
Oh, did robbers not need to output an OEIS seq? That doesn't make sense o_O
 
anything more?
 
I was under the assumption they did
Ah you've edited, k
 
3:33 AM
modifications:
- implemented algorithm for #characters_to_be_hidden
- robber's sequence also need to be in OEIS
 
@KennyLau as I think about it, I'm not sure you need any rules about characters hidden
I mean, let them any any amount of characters they want
 
@NathanMerrill So I could just hide everything
 
@NathanMerrill Why?
 
@Sp3000 ( ͡° ͜ʖ ͡°)
 
3:34 AM
if you hide everything, the robbers have an easier time
because they can simply find the sequence, and generate it
if you have letters in certain places, it actually makes it harder
 
Anonymous
Maybe make the amount of characters hidden proportional to the length and the number of examples given?
 
^^ was wondering about that myself
(Nathan's comment I mean)
 
@Sp3000 how many points are the larges? if I solve all smalls, will i get 30?
 
Anonymous
Or just have it scale logarithmically with program length
 
@Maltysen Scores are on the left, different per problem
 
Anonymous
3:35 AM
@Maltysen You can look on the contest dashboard
 
In this case, yes all smalls is enough
 
do you guys disagree? Wouldn't a completely-hidden program be easy?
 
hah, does Coin Jam literally give you the test cases in advance
 
Anonymous
All smalls are 10 each, so you only need 3 smalls to qualify
 
you don't even have to care about performance; you can literally just bruteforce it
 
Anonymous
3:36 AM
@Doorknob Yep it's dumb
 
its to the cops' advantage to show characters
 
Anonymous
Well the large is much harder to brute force
 
modifications:
- hide as many as is so wished
- robber's sequence also need to be in OEIS
 
@Mego Counting sheep is 7
 
@QPaysTaxes yes
 
3:36 AM
@ChrisJester-Young One last question: is there a version of (list-tail that modifies in place?
@QPaysTaxes oh I forgot about that
 
Anonymous
@Sp3000 Oh yeah, but the large is easy too, so I'm lumping those together as 15 total :P
 
we still didn't fix that
 
:/
 
@Sp3000 well unless you're an idiot and don't get a-large…
ninja'd
 
how are you guys doing factorization? I was generating a seive, but that threw an memory error
 
3:37 AM
Well if you're confident in A large, you could use that in case of D small I guess
 
Anonymous
@NathanMerrill Standard Python kata
 
@NathanMerrill you don't need to
 
or you could just do Coin Jam small and large
 
@QPaysTaxes I'll take another look at it tomorrow. I can probably figure it out if I actually give it my full attention
 
@NathanMerrill construct a prime table first
 
3:37 AM
(I've already done A small and large though)
 
you just need a prime factor
 
Anonymous
Just modified slightly so that it will return a factor if not prime
 
@Maltysen oooh, clever
wait no
 
@NathanMerrill you're talking about c in gcj right?
 
Anonymous
3:38 AM
Since you know the size of the numbers in advance, you could use a sieve to generate an appropriate prime table
 
Anonymous
And then trial division with that
 
@NathanMerrill so just do trial division till u get a factor for each base
 
@Mego which gets too big
 
Anonymous
Not really
 
bah, I don't want to brute force it
 
Anonymous
3:39 AM
It's primes in range(2**31+1, 2**32)
 
@NathanMerrill project Euler IIRC had you make a sieve for up to 10 billion which worked in python
 
@Maltysen the numbers are much larger than 10 billion
 
are you doing large?
 
Anonymous
Actually it's not
 
Anonymous
Oh wait I'm forgetting about the different bases
 
Anonymous
3:40 AM
Yeah a prime sieve is definitely not the way to go
 
yeah its 10^32 at the largest
 
Anonymous
sum(10**i for i in range(32)) actually
 
I think that a non brute force would involve finding composites in each base and seeing if they fullfil the criteria
 
@quartata How could you have a modify-in-place list operation when lists in Racket are immutable?
 
@ChrisJester-Young Because I'm dumb
 
3:42 AM
@Mego the largest number is "1" 32 times in base 10
which is effectively 10^32
 
Anonymous
@NathanMerrill And 10**32 is '1'+'0'*32
 
oh, I understand
 
Anonymous
You're off by a power of 10
 
Anonymous
It's O(10**31)
 
yeah
so, either I need an efficient factoring function
or I need some way to generate numbers
 
3:44 AM
@mego how's it?
 
but you don't need to factor
 
I think the latter is more interesting
 
you just need one factor
 
Anonymous
You don't need to factor because you only need one factor
 
Anonymous
Ninjo'd
 
3:44 AM
@NathanMerrill but yes that is true and probably the only way in 24 hrs
 
@AlexA.: When did you start coding in earnest?
 
@El'endiaStarman I haven't used Earnest. Is it compiled?
(I'm kidding)
 
At least that pun isn't as bad as another potential one... :P
 
:P
 
Anonymous
@AlexA. ಠ_ಠ
 
3:46 AM
4
A: "Stair-ify" a string

Kenny LauPyth, 61 bytes V_Q aY?}N"aeiou"=hZ?}N" "=tZZ;Jh.mbYKh.MZYjC.b++*d+JNY*dK_YQ Try it online!

Care to golf this?
 
@El'endiaStarman ( ͡° ͜ʖ ͡°)
 
Anonymous
Golf your own code
 
@AlexA. What's the probability that you'll respond to a serious question non-seriously?
 
Anonymous
@HelkaHomba Seriously?
 
3:46 AM
@HelkaHomba Pretty high, it seems. :P
 
@HelkaHomba Mu.
 
@HelkaHomba About 0.8
 
@AlexA. Not sure if this is serious or not...
 
@HelkaHomba The probability that it's non-serious is 0.8
@Sp3000 I don't understand
 
@Sp3000 For the record, "HobbesianTiger" is not me
@AlexA. Right, but how do I know if your response to my serious question was serious?
 
3:50 AM
@HelkaHomba Well, if P(non-serious)=0.8, then P(serious)=0.2.
 
Anonymous
That's assuming 0.8 is a serious answer
 
So there's a good chance 0.8 is incorrect
 
You're assuming non-serious and serious are complementary events, which may not be true
 
or, wait..
 
Anonymous
@Sp3000 By definition, A and NOT A are complementary
 
3:52 AM
@Sp3000 😏
 
0
Q: Switching Gravity

jrichChallenge You are given an ASCII-art representation of characters on a plane as input by any reasonable method. This will only contain: [a-z] representing moveable characters. Every letter will appear on the board at most once. # representing immovable walls . representing empty space For ex...

 
@Mego You're a high rep user on this site. You're serious about something non-serious. QED.
 
@Mego In logic, yes. In real life...
 
Anonymous
@Sp3000 Code golf is srs bsns
 
Seriously Beans?
Wait not
 
3:53 AM
@Mego Didn't quartata make that?
 
@HelkaHomba uh no
 
Anonymous
@HelkaHomba ಠ_ಠ
 
Mego made Seriously.
I made pl.
 
Anonymous
in Three Word Chat, 5 hours ago, by Helka Homba
quartata ≈ mego
 
Penguins are gliders. Cut me some slack
2
 
3:54 AM
(and Rotor which I'm ashamed of, as well as Cinnamon Gum which isn't really ready yet)
 
Anonymous
Only when we're learning to fly
 
Anonymous
Really we're more of sliders
 
@AlexA. Reason I was asking is that I'm curious as to whether you were already a programmer by the time you started dating. The responses I've gotten so far are making me think I should do two blog posts, one from the programmer's perspective and one from the other perspective. So, like, if you could go back in time 6 or 7 years and give your girlfriend advice or something on what it's like to date a programmer, what would you say? (And conversely for her.)
 
@Mego Pretty accurate
 
@AlexA. How
 
Anonymous
3:56 AM
I was a programmer before I met my current gf
 
@Mego I'd appreciate feedback from you too. :)
 
Anonymous
The advice I'd give is "expect me to take everything too literally, but it's not always because I'm joking around"
 
Anonymous
Also "be specific"
 
I think my new CnR answer is actually pretty difficult: codegolf.stackexchange.com/a/77437/2867
 
3:57 AM
"Difficult" being relative for something with only 5 hidden characters.
 
Phi just got steamrolled
 
@AlexA. What
 
@HelkaHomba With videos?
 
yes
 
3:59 AM
What does that video have anything to do with my reply
 
@El'endiaStarman I don't think I've ever really considered myself a programmer. What I do now is pretty specialized and I've only done it for a few years now.
 

« first day (1897 days earlier)      last day (2933 days later) »