You are given a list of 2-tuples of positive integers, of the form:
a1 b1, a2 b2, ..., an bn
In other words, the 2-tuples are comma-separated, and the integers within each tuple are space-separated. All of the a numbers are in strictly increasing order, as well as the bs. Your goal is to "fill ...
On the other hand, maybe it's like the boggle board packing challenge, where thinking didn't help anyone, and the winning strategy was to randomly slap things onto the grid
roll me back a game of hearts
code-golf card-games
Roll me back a game of hearts
given just a deck of cards
please.
So, I've been playing a game of hearts (https://en.wikipedia.org/wiki/Hearts) with three of my friends but I'm not entirely sure if all of them were playing perfectly according t...
I had to write a code for finding all non-empty sublists of a list:
def sublists(s):
if s:
for j in range(1, len(s)+1):
for p in sublists(s[j:]):
yield [s[:j]] + p
else:
yield []
I managed to shorten it (for Python 3.4+) to:
def sublists(s, ...
> The email you send will go to one member of the team (euler) who will compare the address you provide in the body of the email with an archive of the Project Euler database which is located only on his local machine.
^ Sounds like that might not be entirely truthful...
Also, a terrible process all around IMO, but that's something else...
But seriously, it's the first thing I notice when I see those acts. The over-the-top expressions kill the act for me. The Jason Latimer clip just exemplifies it.
@aditsu For good measure, I think it might be good to have a second example in overhanded shuffle where there's 0 cards implicitly placed on top at the end of a line
Return of the 5318008
Introduction
A week or so ago, I posted the challenge 5318008, with a massive reaction. Now, I want you to do the same again but with musical notes.
Challenge
Given a word list, you must output a list of words which can be formed using musical notes. However, the word mu...
If it makes you feel any better, it took me a week of messing around in turtle before I found out about tracer :P (I found speed pretty quickly, but that's still slow)
@Sp3000 Thanks, my idea with that: given a number find the largest sum of digits if superimposing digits is also allowed, so e.g. 123 => 1&3 + 2 = 8 + 2 = 10
Translate Treehugger to BrainF**k
code-challenge (?)
Overview
This problem deals with two esoteric programming languages that I will briefly describe for completeness.
Brainfuck is a language that has only 8 commands. Imagine a tape of values (generally 0-255) stretching infinitely to the rig...
You should write a program or function which given a list of tetris blocks as input outputs or returns the biggest gap between two points in the same height level which the pieces can connect.
The 7 types of tetris pieces are the following:
We will refer to these pieces by the letters I, J, L...
No, they don't breathe very well so I don't wear them much in the summer. Still, the added wrist support is nice if I have to downvote someone massively. Otherwise my click-fatigue sets in.
Well of course I'm wearing the rest of the suit. That was a given.
Since codegolf.stackexchange.com/q/53027/194 still has only two close votes, I assume there must be a lot of people who understand what he's asking. Would one of them mind doing a major edit to make it clear in the question?
@randomra Seems like you've been bitten by the Retina bug. (Which I'm realizing now has a very different connotation in the context of programming, but I'll go with this outdated slang anyway.) Going to change your name to retinara?
Background
After applying the BWT (as seen in Burrows, Wheeler and Back) and the MTF (as seen in Move to the printable ASCII front), the bzip2 compressor applies a rather unique form of run-length encoding.
Definition
For the purpose of this challenge, we define the transformation BRLE as foll...
You are given a list of 2-tuples of positive integers, of the form:
a1 b1, a2 b2, ..., an bn
In other words, the 2-tuples are comma-separated, and the integers within each tuple are space-separated. All of the a numbers are in strictly increasing order, as well as the bs. Your goal is to "fill ...
roll me back a game of hearts
code-golf card-games
Roll me back a game of hearts
given just a deck of cards
please.
So, I've been playing a game of hearts (https://en.wikipedia.org/wiki/Hearts) with three of my friends but I'm not entirely sure if all of them were playing perfectly according t...
I had to write a code for finding all non-empty sublists of a list:
def sublists(s):
if s:
for j in range(1, len(s)+1):
for p in sublists(s[j:]):
yield [s[:j]] + p
else:
yield []
I managed to shorten it (for Python 3.4+) to:
def sublists(s, ...
Return of the 5318008
Introduction
A week or so ago, I posted the challenge 5318008, with a massive reaction. Now, I want you to do the same again but with musical notes.
Challenge
Given a word list, you must output a list of words which can be formed using musical notes. However, the word mu...
Translate Treehugger to BrainF**k
code-challenge (?)
Overview
This problem deals with two esoteric programming languages that I will briefly describe for completeness.
Brainfuck is a language that has only 8 commands. Imagine a tape of values (generally 0-255) stretching infinitely to the rig...
You should write a program or function which given a list of tetris blocks as input outputs or returns the biggest gap between two points in the same height level which the pieces can connect.
The 7 types of tetris pieces are the following:
We will refer to these pieces by the letters I, J, L...
Background
After applying the BWT (as seen in Burrows, Wheeler and Back) and the MTF (as seen in Move to the printable ASCII front), the bzip2 compressor applies a rather unique form of run-length encoding.
Definition
For the purpose of this challenge, we define the transformation BRLE as foll...
