« first day (1634 days earlier)      last day (3217 days later) » 

5:48 AM
What does the `:` do in http://codegolf.stackexchange.com/a/47888/41711 ?
@Optimizer
 
6:05 AM
It vectorizes it
I think
: - infix operator, can be followed by:
- variable name - set variable
- unary operator - map
- binary operator - fold (reduce)
So it's a fold in this case
Not vectorize at all
 
6:34 AM
@RetoKoradi hi
 
0
A: Sandbox for Proposed Challenges

es1024ASCII Scores code-golf music ascii-art Digging around in the depths of your temp folder, you find some compositions for the piano. Unfortunately, these compositions were written with note names and durations only, and you only have access to a text terminal. Therefore, your task is to write a...

 
6:57 AM
@Lembik Sorry, I wasn't on chat. I got the updated code at work, but didn't want to post it from there. You never know if somebody freaks out if the detect that you're posting source code to a web site. I'll try and bring a memory stick tomorrow.
 
@RetoKoradi do you work for the nsa? :)
 
Not quite. :)
 
:)
did you see my post about 2^17?
I mean my comment
 
I actually worked for Samsung for a while, and word was that they were watching the screens of employees. And I would fully believe it.
 
I think they are meant to tell you aren't they?
depending on where you were physically of course
 
7:00 AM
Well, most employers tell you that they have the right to watch what you're doing. You just don't think that they would actually do it, without any good reason.
 
the 2^17 point was just that sometimes the max circulant det reaches the max for any (0,1) matrix
and of course this means the max toeplitz one does too
I think the formula is 4n-1 not 2n-1
which doesn't explain n = 30 of course :)
in general, we should check if the max we reach is the max for general (0,1) matrices as we can stop then
 
I hadn't seen that comment. So for a general binary matrix, the maximum determinant is always a power of 2?
At least if the size is 4*n-1?
 
@RetoKoradi Take a look at oeis.org/A003432
I am not sure it is that simple
arxiv.org/pdf/1112.4160v1.pdf has them up to 37 for +-1 matrices and I think you can convert from that to 0,1 ones
 
That OEIS entry has the value for 36, but nothing else that is close. Weird. Anyway, I tried for n=17 for the Toeplitz matrix, which completed in about half an hour. I started n=19, should be complete when I get back tomorrow morning. n=20 would take about a weekend. Roughly four time as long for each n -> n+1.
Yes, it says there that g(n) = 2^(n-1)*a(n-1). Where a() is the count for 0,1 and g() is for +-1.
 
7:20 AM
@RetoKoradi what do you mean it has the value for 36, but nothing else that is close?
oh I see
indiana.edu/~maxdet is associated website
they should update the oeis entry :)
@RetoKoradi I look forward to seeing the opt values up to n = 19!
of course if you make the make available maybe someone can code it for a gpu :)
 
If I read the OEIS entry and related web site correctly, the maximum for a 0/1 matrix for n=30 is 75960984159088. But I guess that tells us nothing about the maximum for a Toeplitz matrix of that size. Except that it can't be higher, of course.
 
right... it does tell us nothing :)
although oeis.org/A086432 has 65455857159975
 
It is interesting that at least 3 people get the same value, and nobody gets anything higher.
 
so I suppose one question is, is it ever the case for smaller n that the max toeplitz=max circulant != max overall
@RetoKoradi it is interesting but if we are all optimizing one variable at a time maybe not too surprising
actually.. I am interested in the max toeplitz=max circulant != max overall case.. do we have any of those?
 
I have a variation running now that goes a little farther. Once it can't make an improvement with changing one bit at a time, it starts inverting and reversing sub-sequences. So far, no improvement.
 
7:28 AM
@RetoKoradi cool! But as I say... I think we should focus on the smallest n that shows this interesting property
n = 30 is too big for us ever to be sure
 
I'll have to look at the larger one. Up to n=15, the maximum does not seem to be circulant. At least the one I printed. There could potentially be tied results that are circulant. I can probably change it to list all tied matrices. At least if there aren't too many.
 
which is.. n = 18 I think
did you work that case out?
I get 2994003 for max circulant and toeplitz
but 3411968 for max overall
if you have done that exhaustively it would be very interesting to know what the true max toeplitz is
 
n=19 (which obviously includes n=18) is running on my work computer. Should be done by tomorrow morning. I got a nice quad core desktop there. It finished n=15 in 1:30 minutes.
 
oh I see .. when you do n = 19 you do them all up to 19
 
yes
 
7:31 AM
cool... if n= 18 is really the way it seems to be then it tells us something :)
that is that it is possible for max toeplitz=max circulant != max overall case
have you ever used amazon cloud services?
they seem to offer a free account that might be suitable
 
Not really. Well, not very directly. I work for Amazon, so in some form I obviously use the cloud services.
 
I see :)
but in principle we could just run your code on the cloud, right?
 
I guess, yes. I work on device software, though.
 
ah.. is that in london?
 
No, Silicon Valley. We have some teams in Cambridge.
 
7:34 AM
which cambridge? :)
 
Near London, since you asked about that. :)
 
ah yes.. the real cambridge :)
 
There were already some people from an acquired company there, and we hired a bunch of people when Broadcom closed down parts of their business.
 
got you
so my real problem is that I can't remember who I should award the win to for codegolf.stackexchange.com/questions/53183/…
Nick Alger or isaacg?
I think it is Nick Alger
 
The one who posted the value first, I guess? You'll have to look at the post history.
 
7:38 AM
I think it was nick alger
it's actually a very nice idea... I had to ask on math.se why it works :)
11
Q: Do the matrices with maximum determinant always have integral values

LembikConsider all $n$ by $n$ matrices whose elements are real values in $[0,1]$. Now for a given $n$, consider all those matrices with maximum determinant. Are all the elements of these matrices always either exactly $0$ or $1$? From numerical experiments this seems to be the case but I don't s...

 
Mine is more similar to isaacg. I tried a less greedy simulated annealing algorithm first. But at least in the time I ran it, it only got to about 4.7*10^13.
 
I trivially randomized isaacg's which seems to help a little
    nums = range(n+h-1)
    random.shuffle(nums)
    for flip_at in nums:
 
I don't think a mostly randomized approach works well because a very small change in the bit pattern changes the value massively.
 
right...it would be nice to find small moves
I suppose changes to the top right and bottom left of the matrix have little effect
and I was wondering about swapping consecutive diagonals
that is keeping the number of ones constant for some moves
 
I tried reversal and inversion of random sub-sequences. But I think what happens is that once you get to a high value, a typical simulated annealing gets stuck because every attempted move makes the target function so much smaller. There's really no locality to the function.
And if you set the temperature high enough to prevent this, it will just go all over the place.
So yes, the reversals keep the number of ones constant.
 
7:51 AM
interesting... the heuristic I was taught about simulated annealing was always to have small local moves and also some big ones
but it seems our problem is to devise small moves
on the other hand, it is possible our very crude hill climbing works brilliantly :) we don't know yet
 
I typically get that maximum value that the other two posters got in a fairly short time. Less than a minute, probably. That's with running a semi-greedy algorithm. Of all the 1-bit changes, I find all the ones that improve the score, and choose a random one from them.
 
so you never choose one that makes things worse?
it seems that your more is almost exactly the randomization I did
 
Not with this one, no. As I mentioned, I tried simulated annealing earlier.
 
as my randomization chooses the bits in random order and accepts the first one that improves things
 
Yes, that sounds like it would probably do the same thing.
 
7:56 AM
do you restart from a random position once you get to a local max?
 
I start with all zeros.
 
oh!
 
I also accept changes that tie the current score.
 
does it make any difference if you start from a random bit string?
I suspect not
I think if one were being paid to do this I would look at all matrices of some small size ordered by determinant and see if I can spot any small moves
 
Since the determinant is typically 0 until you have a certain amount of 1s in there, the first few moves sort of randomize the starting position. I didn't think of that, but it might not make a big difference anyway.
 
7:58 AM
good point
 
It seems hard to believe that a circulant matrix, which has half the allowed degrees of freedom, would actually be the maximum. But maybe it is.
 
well..
1, 1, 2, 3, 4, 9, 32, 45, 95, 275, 1458, 2240, 6561, 19952, 131072,
214245, 755829, 2994003, 19531250, 37579575
1, 1, 2, 3, 5, 9, 32, 56, 144, 320, 1458, 3645, 9477, 25515, 131072,
327680, 1114112, 3411968, 19531250, 56640625
it is for n = 19 too!
n= 19,15,11, 7, 6, 4,3,2,1
:)
4n-1 covers 3,7,11,15,19
looks like n = 20 would be interesting too :)
for the toeplitz case as currently the best I can get is 37579575
 
@Calvin'sHobbies What ? That's not even half of the important things.
 
 
2 hours later…
10:37 AM
0
Q: BYTESM2 - Philosophers Stone

PritamOne of the secret chambers in Hog-warts is full of philosopher’s stones. The floor of the chamber is covered by h × w square tiles, where there are h rows of tiles from front (first row) to back (last row) and w columns of tiles from left to right. Each tile has 1 to 100 stones on it. Harry has t...

 
 
2 hours later…
12:13 PM
@Calvin'sHobbies Yes. And on top of all that, you missed the most important thing. If you couldn't figure that out, then its a shame.
Hint, it ends with m
 
ham is important
 
down with ham!
 
ham can burn through metal: popsci.com/bacon (note: it's ham, not bacon)
and by metal, I mean steel
 
12:33 PM
Question: If a problem is posted on SPOJ without a copyright notice (no mention of CC-SA like some have), that defaults to "rights reserved" and we shouldn't have it copied verbatim here, right?
 
Answer: 42
 
I think that's the answer to a different question, but I don't know which.
 
1:07 PM
@Geobits I'm guessing it can only be posted here by the original poster (who reserved the rights)
 
1:35 PM
0
Q: Square from Digits with Largest Sum

randomraYou should write a program or function which receives a list of digits as input and outputs or returns the largest sum achievable by putting these digits in a square. Input will always contain a square number of digits. An example square arrangement for the input 9 1 2 3 4 5 6 7 7 could be 677 ...

 
Hmm square digit sum would be a bit shorter in CJam if . truncated
 
2:25 PM
Is this question too simple / similar to a previous one?:
Print one word from the input which has the greatest vowel-consonant imbalance (abs(vowel_count - consonant_count)). E.g. runs cat queue => queue
 
Too simple wouldn't be a problem, but too similar possibly (haven't checked though)
 
I've got these:
10
Q: Finding the most 'unique' word

GaffiUsing you language of choice, write the shortest function/script/program you can that will identify the word with the highest number of unique letters in a text. Unique letters should include any distinct character using UTF-8 encoding. Upper and lower case versions of the same character are...

28
Q: Find words containing every vowel

TheDoctorYour program must find all the words in this wordlist that contain all the vowels (a e i o u y). There are easy ways to do this, but I am looking for the shortest answer. I will take any language, but I'd like to see Bash. Here is an example (could be much improved): cat wordlist.txt | grep "a"...

 
2:50 PM
It's similar, but I think it might be different enough.
 
3:01 PM
Yesterday, I put a description of my contest idea in the Sandbox (meta.codegolf.stackexchange.com/questions/2140/…), but I have not received any responses. How long do I wait before I conclude that no response is a vote against the proposal?
 
I'd recommend at least a day, because of time zones
But you can always drop in chat and ask for opinions (like you're doing now)
 
Consider this my shameless plug? {: D
 
@Vioz- You can save 8 bytes with sum(x-1for x in map(s.count,s)) instead
 
Ooh, nice!
 
@sadakatsu I said this (in a more brief form) yesterday, but it's pretty complex. Even writing a standard (full) chess AI is more complex than many (most?) users here are willing to do. Adding complexity means that even fewer will play. I'm not saying this to mean "No don't do it", but just to temper expectations.
Whether that's a good or bad reflection of the site is another discussion. That's just the way I see it actually working.
 
3:10 PM
^^ I agree with the above, it's definitely very complex for a KotH, I'd be concerned whether someone can actually fit their AI in a 30k char post
 
I'd use Git for actual submissions and ask them to highlight snippets.
That's what I did for my "Speed Clue AI" contest last year (which admittedly had dismal participation IMO).
 
Did SE have some self-contained policy or am I remembering this incorrectly?
(It sounds interesting though, but seems to raise a few questions - e.g. can I delay an opponent multiple times in one turn, and can I check and use a delay on the same turn?)
 
A turn is either a move or a drop or a delay.
I can definitely write the description more clearly if this generates interest.
 
(gotcha, missed that part)
 
3:15 PM
As an example, take the existing chess KotH. The rules were even made simpler for the contest (no castling, en passant, etc). While there was what I'd consider decent turnout, most of the entries relied on really basic techniques, because (IMO) making it more complex wasn't worth the fun/time equation they have for challenges here.
 
That contest is why I thought my idea might have a shot : /
 
It might, just don't expect many deep-thought entries. If it requires even more code just to follow the rules at all, there's less incentive to do something clever. Again, my opinion.
 
I appreciate your opinions.
 
It might be worth adding some sample template that checks legality, check(mate), and stuff like that. People are lazy with that kind of thing.
 
Oh, yeah, I have most of that written already.
I intended to enable users to just extend a Player class.
All they'd have to do is drop in their logic.
 
3:19 PM
Cool. I look forward to seeing a more complete spec :D
 
So would you participate?
 
Only if it isn't an
 
:D I was intending to make a JavaFX GUI for the test server, contest server, and a log walkthrough for debugging.
 
I'd consider it for sure. I like chess, I like KotH, and I entered the other one. I'm just worried about the complexity.
 
0
Q: Simple single-player board game, expected score distribution

SnowbodyThis is the first problem I've posted here; please post criticisms in comments. Summary A game board consists of a starting space, an ending space, and between them are N spaces, each with an instruction. You begin on the starting space with 0 points to your credit. Flip a coin or roll a die to...

 
3:44 PM
@Sp3000 Where can I look up the rules for contests and their answers?
 
You can try checking meta as a start
For challenge types, you can also check the tag wikis
 
According to codegolf.stackexchange.com/tags/king-of-the-hill/info , using Github for hosting the code and solutions is acceptable.
 
Oh, ok then
 
Thanks for pointing me in that direction. That page also listed suggestions on the server-client model.
 
4:52 PM
damn I am getting rusty.. @Sp3000 is beating me in CJam ! :(
 
hi @RetoKoradi
 
5:10 PM
0
A: Sandbox for Proposed Challenges

Joseph MalleCJam Expander Input: a program written in CJam. You can accept input however you'd like. Output: the same program ready to be put into a PPCG answer. You must: Not change the horizontal position of any token in the program. Put each token one line below the previous one except } which must ...

 
5:34 PM
0
A: Sandbox for Proposed Challenges

randomraVowel-Consonant Imbalance Sandbox question: Is it too easy/too close to an existing question? Related ones I found: Find words containing every vowel and Finding the most 'unique' word You should write a program or function which receives a list of space-separated words as input and outputs or ...

 
@RetoKoradi looks like it is time for a new OEIS entry :)
 
6:20 PM
0
Q: Can Coderbyte challenges be posted here?

Alex A.Recently the challenge Word with greatest repeat of letters was posted. The OP said that it was inspired by a question on Stack Overflow, in which the user sought assistance with a solution to a Coderbyte challenge (specifically Letter Count I). The challenge posed here amounts to a reproduction ...

 
6:39 PM
@Geobits Well that was resolved quickly
 
Just the way I like it :D
 
That's not really something to be proud of :P
 
Says someone named Optimizer.
 
Doesn't mean it has to end fast, just efficiently ;)
 
That... doesn't sound much better. Messy has its perks :)
 
6:43 PM
again, efficient can be messy too :P
depends on what you are optimizing ;)
 
True. Also depends on the situation whether "resolving quickly" is a good thing. Sometimes you just don't have much time.
 
there's always time.
 
Other people on the plane get upset if you take too long.
 
it's worth it!
 
:D
 
6:46 PM
Also, you don't want to open the door midway.
 
To any new users just joining the chat: Welcome to The Nineteenth Byte!
But yea, the door opening would be bad. Probably end in some kind of arrest or fines.
 
And there he does it ..
Don't you have enough starred messages already ?
 
Is there such a thing? That's like asking if you have enough rep, Mr. I-Just-Hit-20k ;)
 
That would be @Calvin'sHobbies
Google, what the fuck are you doing http://t.co/1everLk4F7
damn, no image preview.
 
7:11 PM
we need Google++
 
Google#
 
GoogleScript
 
GoogleJam? :p
 
I think that is what powers Siri.
So these jokes must have been committed back to source.
 
 
Why do you insist on putting up that answer when its clearly not an answer to the question?
"I thought it would be good practice for O" is not a valid point to keep letting a non-answer
 
7:54 PM
Thanks for understanding!
 
@Optimizer :P I first thought the question was a mistake, and I took it as a challenge. Then, I just never deleted it.
 
are you sorry?
 
0
A: Sandbox for Proposed Challenges

vihan1086Redraw an Image code-golf In this challenge, you'll be redrawing an image with colors from another image. Input The input will consist of two image files. The first image will be the one you need to redraw, the second will be the image which you grab the colors to redraw the first one with ...

 
@Geobits Yeah, cause that's exclusively my job.
 
8:19 PM
0
Q: My Squiggly Lamp

phaseWhile moving, I broke my lamp. Now, I need a new one. It's your job to make me a lamp! I'm not sure what size I want, though I know I want a squiggly one. Your program/function must take in a number input, and print out a lamp with that many squiggles/bumps. Examples: Input:2 Output: /--\ ...

 
@Doorknob I prefer handles for most things. Knobs are okay, but....
 
@Geobits Traitor! :P
 
tbh, I don't why you have so many sudden upvotes.
 
I have no idea either. O_o
 
Wasn't me :P
 
8:32 PM
One more byte to beat Snowman :/ (but as xnor says it's a pretty boring challenge)
In standard languages, anyway :P Esoteric might be a bit more interesting
 
Come on, even with a language that was intentionally designed to be verbose I'm still not the longest.
2
 
@Geobits You would be the last person for us to think doing sudden upvotes
 
Clearly, you're not trying very hard then, Doorknob :P
 
@Doorknob intentionally designed to be verbose? :P every answer of yours accompanies with the fact that you forgot to implement the only feature really required by that answer :P
 
Well... okay, hmm, maybe not verbose, but confusing is the word I'm looking for. :P
(this one's pretty straightforward, but only because the challenge is so simple. I have yet to write a working BF interpreter...)
 
8:36 PM
Confusing and verbose are two very different concepts :P
 
retag it to ?
 
2
Q: Retina or Trash!

Vioz-Retina or Trash! We live in a wonderful age of technology where we can have beautifully detailed 8K screens on our TVs, and even 2K displays on our phones for our mobile browsing pleasure. We've come a long way in recent years in terms of screen technology. One of the products of this is a ter...

 
^^ Good thing Retina doesn't have floats
 
@MartinBüttner needs to solve that in Retina ^
awww. :P
 
:P
 
8:40 PM
but Snowman does!
 
But that's not the right challenge
 
lol
 
Dorrknob took it literally
 
... why is it that every challenge I try to solve exposes a new bug? Apparently the function that parses decimal numbers that used to work no longer works. -_-
 
Write unit tests?
 
8:49 PM
That is probably a thing I should do.
 
18 mins ago, by Optimizer
@Doorknob intentionally designed to be verbose? :P every answer of yours accompanies with the fact that you forgot to implement the only feature really required by that answer :P
You know Imma slap it in yo face every single taim
 
I've already found it weird that JS answers have been randomly downvoted without comments recently... but Prolog? Why would anyone randomly downvote Prolog?
 
@Geobits was that you?
trying to make your downvote numbers equal to upvotes' ?
 
@Sp3000 in ><> the top of the lamp could be code too e.g. the first line could be "aivx
 
The first row is the base of the lamp, actually
But yeah it probably could be, I didn't think too hard about it
 
9:03 PM
lol, double backwards is forward, right (it seems like the top if you read the string)
 
I'll do it to the third line - just need to pick something that looks half decent
 
like this one? :)
golf
 ()
 ()
 ()
 ()
 ()
/__\
 
That's a terrible lampshade D:
 
hmm, 16 answers to the two most recent questions in less than an hour
 
Clearly, we need to add more brainlessly easy challenges :P
 
9:07 PM
I did my part today:
8
Q: Square from Digits with Largest Sum

randomraYou should write a program or function which receives a list of digits as input and outputs or returns the largest sum achievable by putting these digits in a square. Input will always contain a square number of digits. An example square arrangement for the input 9 1 2 3 4 5 6 7 7 could be 677 ...

and have an even simpler one (vowel-consonant difference) in the sandbox
 
Only 3 answers though :P Not trivial enough
(lampshade is now ~\_!)
 
@Optimizer Was what me? I've been driving since my last comment, so whatever it was, umm... no.
 
@Sp3000 I can see that as a Pixar style lamp
or surveillance cam
 
@Geobits Optimizer has been paranoid about ham or something lately
 
Fair enough. Personally, I like ham, but to each his own.
I guess llamas don't do much meat in general.
 
9:13 PM
@Sp3000 Okay, lets raise the stakes. I hereby promise to slap a big juicy 500 pt bounty on the shortest legal (community consensus) Retina answer to this question one week from this comment posting timestamp. — Digital Trauma 4 mins ago
folks - you'll have to hold me to this one - otherwise I might forget ;-)
 
Add it to the no-deadline list
 
20
Q: List of bounties with no deadlines

randomraThis is a list of unofficial, deadline-less (hence not searchable) bounties offered by users on various challenges on the main site. Disclaimer: There is no guarantee that the user will award the bounty for you in case you fulfill its requirement. Especially if the user isn't an active member an...

Though I guess it technically has a deadline...
 
ok, I'll think about extending it indefinitely...
 
Mini challenge: Convert space-indented X's to a hierarchical numbered outline list. Like this.
 
I'm assuming we can't assume rectangular padding with trailing spaces?
 
9:20 PM
@Calvin'sHobbies today this is definitely a full challenge
I would say, it would be on other days too
 
@DigitalTrauma will do ;)
 
9:36 PM
@Calvin'sHobbies Terribly golfed, but something like
Hmm actually that's pretty terrible
@MartinBüttner Since you're here, any tips for golfing cycles in TIS-100? (just got it)
 
@MartinBüttner I hope you don't have some ace up your sleeve where you added full float support last night, or something like that
 
@Sp3000 I haven't bought it yet... I just read that it left early access, so I'll probably be buying it soon
@DigitalTrauma who needs float support...
 
@MartinBüttner built-in arithmetic is for wimps, right?
 
exactly
hm, this is a bit slow...
 
10:01 PM
3
A: Retina or Trash!

Martin BüttnerRetina, 530 bytes +`(\d+) (\d+) (\d+)\.(\d) ${1}0 ${2}0 $3$4. \. \b(?=\d) # +`(\d*)#(?:(((((((((9)|8)|7)|6)|5)|4)|3)|2)|1)|0) $1$1$1$1$1$1$1$1$1$1$2$3$4$5$6$7$8$9$10# \d 1 1(?=1*(?<=(1+))#) $1 # (1+)# $1 r`(?<= .*)1 1111111111111111111111111111111111111111111111111111111111111111111111111111111...

 
I like how you divide by 300 :P
 
I multiply by 300 :/
 
... oh nvm, I thought you were doing something else
 
I'm trying something else now
(which lets me use {300} instead)
yup, works
it's also much faster now
 
@Sp3000 Can I see it again, actually?
 
10:10 PM
def f(I):
 S=[]
 for i in map(len,I.split("\n")):S=(S+[0])[:i];S[-1]+=1;print" "*~-i+`S[-1]`+"."
You haven't defined clearly what happens with >1 digit numbers, so I assumed that the preceeding number of spaces just had to be the same as the one digit case
 
I shortened it a bit...
 
Nice :)
 
and it handles floats?
 
It wouldn't need to if you can move the decimal place appropriately
 
10:16 PM
right
 
wow, that was a quick Retina answer
 
0
A: Sandbox for Proposed Challenges

vihan1086Average color of an image code-golf Scientists have been able to determine the average color of the universe but in how many bytes can we find the average color on an image? Your task Your input will be a single image which you will need to find the average of the colors in the image and outp...

 
@DigitalTrauma heading to bed now... you'll get a full explanation tomorrow (I hope)
 
@MartinBüttner Hi
 
10:23 PM
@Calvin'sHobbies Lo
 
That's all
 
I'm glad we talked about it.
 
1
Q: Numbering Hierarchical Outlines

Calvin's HobbiesWrite a program that takes in a string where every line consists of the character 0 indented by some number of spaces. The top line is not indented and every other line will be indented by at most one more space than the line just before it. No lines will have trailing spaces but you may optiona...

 
@MartinBüttner I'm sure you will find a lot more to golf but here is one (if correct):
\b\d
#$0
 
@NewSandboxedPosts This got me thinking - how about a pop-con that takes in an image and a color C. The goal is to make the average color of the image be C with minimal visual difference.
 
10:31 PM
@randomra oh thanks. I'll have a thorough look myself tomorrow
 
@Calvin'sHobbies I would frame the exact goal picture with a properly colored frame :)
@MartinBüttner ok, I will wait til then with my further tryings
 
@Calvin'sHobbies Depending on the color space, I think that would involve fiddling with blacks more than anything, since there's a wide range that people see as "black" with little contrast. For those pictures that have a bit o black at least.
 
@MartinBüttner anyway, spectacular return to PPCG after the short vacation :)
 
@Calvin'sHobbies Will we ever have to worry about longs? i.e. can I use backticks instead of str()?
 
@randomra thanks :)
 
10:56 PM
:/ my face when one of my (in-person) friends credited something to "PhiNotPi" and not my real name.
 
@PhiNotPi Are your in-person friends not supposed to know your super hero identity?
 
he knows too much
 
Remember to only use your powers for good
 
@Sp3000 Backticks are fine
 
k, will wait for you to fix the question example before posting :)
 
11:02 PM
@Calvin'sHobbies Comment deleted
 
@Calvin'sHobbies By "input string via STDIN", does that mean something like "0\n 0\n..." is okay or does it mean an actual multiline string?
 
@Sp3000 Either is fine
 
Hmm k :) (honestly, I've never figured out what the rules are on expecting evalled strings "..." from Python 2 input)
 
0
Q: ES6 Fat Arrow Notation with Loops

WallyWestConsider the following bit of code: f=(m,c)=>{m?c()&f(--m,c):0} (thanks to zzzzBov for this little nugget) which is a "for"-less loop and the following: a=b=>b++ Given these two snippets, and the fact that: z = 0; f(10,a(z)); which I would expect would result in z equating to 10, but i...

 
11:31 PM
Am I allowed to put part of my code in another file?
 

« first day (1634 days earlier)      last day (3217 days later) »