@Geobits Barring cases where you don't need to do list() as trichoplax points out, the only golfier way I know is to grab 3.5.0 from beta and do [*s] :)
GolfScript, 80 (77) bytes
~.,~)3%:P[0]*+[4]3*\+256base 64base{'+/''A[a{:0'{,^}/=}/{;}P*'='P*]4>76/"\r
":n*
The above will fit exactly 76 characters in a line, except for the last line. All lines are terminated by CRLF.
Note that RFC 2045 specifies a variable, maximum line length of 76 charact...
GolfScript has no operators that turn to upper- or lowercase, so it's a lot more useful for GS.
Image to Unicode
Today you decide you don't want to use images anymore so you decide to convert all your images into text.
Example Input / Output
Input:
Output:
██ ████
████ ██
██ ████████
██ ...
Granted, wget can't (and couldn't for the last years) handle dropped SSL connections (which shouldn't take longer than 10 seconds to fix), but everything on my PC is open source and most of it works pretty darn well...
@AlexA. They may be awesome as long as they do exactly what you need, and don't have nasty bugs. Otherwise they may end up causing you more work than they save. Yes, I may have gotten slightly cynical after spending weekends at work trying to fix bugs in horrible open source projects.
This has been puzzling me, because if the human half needs human nutrients, then suckling from the human nipples makes sense. But the horse half needs different nutrients, so which set of nipples makes most sense?
Once you do the handwaving needed to explain a modern-day world with flight-capable dragons in it, how would said dragons interact with the bureaucracy surrounding flying in the modern world? What sort of pilot's license would they hold? Would they get certified as an aircraft of some sort (per...
Meme: Questions that are absurd without context
Originator: Various
Cultural Height: As Often as Possible
Background:
How can I get my wife to stop nagging about a few murders? fable-3
Can I pass out from excessive drinking? bioshock
How can I tell if a corpse is safe to eat? nethack
How c...
@Dennis, just FYI, if you write for Bashman, I will illustrate. ;)
@AlexA. So far, the only meaningful reduction of the source code's length I can achieve is to convert the entire thing from base 126 to base 256, which saves 13 bytes. Pretty ugly.
@Dennis I think you're the only person even thinking about the challenge at this point, so I'm fairly certain you'll end up getting the bounty and winning, even if only by virtue of being the only answer. :P
@AlexA. they tend to smell like everything these days... e.g. "Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/43.0.2357.130 Safari/537.36"
Also, since we're already talking about the online interpreter, it would be nice if something else than prompt could be used for copying permalinks. It truncates the permalink after a certain amount of characters and sometimes introduces newlines.
@aditsu Yes, that was the intention. location.search is even better. Replace that, a # with a ? and you're done. Not pretty, but no browser sniffing. :P
Yes, that would require applying UTF-8 encoding first...
@aditsu Probably a stupid idea, but what if you append &test=%25 to the permalink? A hash containing &test=%25 hasn't been decoded, so decodeURIComponent has to be executed.
Still not ideal, but better than building a database of browsers that do or do not decode the hash by themselves.
This is starting to get painful. The shortest partial fix I can think of adds 15 bytes and still doesn't deal with 1e2e3, which happens to eval to an integer.
Red Strings of Fate
code-golf
(This is the classic "join pairs without any paths crossing" problem. It's probably been asked before, but the problem is it goes under so many different premises that I can't find any duplicate.)
Synopsis: Given the positions of pairs of lovers on a non toroid...
I've been using a library called Djangular recently, which integrates Django and Angular.
After a while I thought 'Wouldn't it be fun to programmatically generate portmanteau?'
Here are some examples (e.g. testcases):
Django + Angular -> Djangular
Camel + Leopard -> Cameleopard
Croissant + Don...
If there's any CJam operator I don't understand, it's j. Well, I did see an example, but it just didn't look like anything I would have a use for anytime soon.
@aditsu Actually, I don't think I changed the content of that loop. That should still be original. What Dennis helped me with was getting rid of the special condition for the empty input, by finding a clever way of trimming off the extra 0.
Yeah, I believe that's where I saw the explanation. It seemed like more than I could digest when I first saw it. Which was probably the day I started learning CJam. I should give it another read sometime.
While you're here, what are the release plans for new versions? There were a couple of things I meant to file. Not actual bugs, but ideas for improvements that I think would be helpful.
I don't know if mathematica has a max independent set function or a max clique function but would you be able to (please) verify my answers before I post them ?
For a given positive integer n, consider all binary strings of length 2n-1. For a given string S, let L be an array of length n which contains the count of the number of 1s in each substring of length n of S. For example, if S = 01010 then L=[1,2,1]. We call L the counting array of S.
We say th...
@Lembik I'm probably just dense here, but in your question, if "L1[i] <= 2*L2[i] and L2[i] <= 2*L1[i]", doesn't that mean that L1[i] and L2[i] are equal?
yes, I saw that. just trying to figure out what the consequences are of meeting both conditions. I guess, in other words it's that one cannot be more than 2 times the other
Usually when performing an internet challenge, there's no problem with having to specify a user agent, but when it comes to dealing with Google, it changes.
Google blacklists the Urllib user agent, presumably to stop spambots, so you have to specify a user agent. This takes up many bytes, and i...
One makes all the difference
cops-and-robbers
Cops Challenge
Write a valid program which, when just one character in the program is changed, removed or added, completely changes the output.
Formatting
Your answer should be in the following format:
# <Language name>
## Code
<code goes here>...
I'm just running through a list of all previously-found unmatched strings, zipping the group counts and checking if one is greater than 2 times the other, breaking if that's the case and adding to the mismatch list
@Lembik I definitely believe 31 is a valid answer, not 100% sure if it's the max, but it's right. I looked at Sp3000's solution of 31 and unless I missed something, it's right.
GolfScript, 80 (77) bytes
~.,~)3%:P[0]*+[4]3*\+256base 64base{'+/''A[a{:0'{,^}/=}/{;}P*'='P*]4>76/"\r
":n*
The above will fit exactly 76 characters in a line, except for the last line. All lines are terminated by CRLF.
Note that RFC 2045 specifies a variable, maximum line length of 76 charact...
Image to Unicode
Today you decide you don't want to use images anymore so you decide to convert all your images into text.
Example Input / Output
Input:
Output:
██ ████
████ ██
██ ████████
██ ...
Meme: Questions that are absurd without context
Originator: Various
Cultural Height: As Often as Possible
Background:
How can I get my wife to stop nagging about a few murders? fable-3
Can I pass out from excessive drinking? bioshock
How can I tell if a corpse is safe to eat? nethack
How c...
Red Strings of Fate
code-golf
(This is the classic "join pairs without any paths crossing" problem. It's probably been asked before, but the problem is it goes under so many different premises that I can't find any duplicate.)
Synopsis: Given the positions of pairs of lovers on a non toroid...
I've been using a library called Djangular recently, which integrates Django and Angular.
After a while I thought 'Wouldn't it be fun to programmatically generate portmanteau?'
Here are some examples (e.g. testcases):
Django + Angular -> Djangular
Camel + Leopard -> Cameleopard
Croissant + Don...
For a given positive integer n, consider all binary strings of length 2n-1. For a given string S, let L be an array of length n which contains the count of the number of 1s in each substring of length n of S. For example, if S = 01010 then L=[1,2,1]. We call L the counting array of S.
We say th...
Usually when performing an internet challenge, there's no problem with having to specify a user agent, but when it comes to dealing with Google, it changes.
Google blacklists the Urllib user agent, presumably to stop spambots, so you have to specify a user agent. This takes up many bytes, and i...
