0
How many ways are there to get from here to there?
Given a board M chars wide and N chars high, count how many ways there are to get from one coordinate to another, by only moving up and to the right.
Examples
M = 5
N = 4
From (0, 1) to (4, 3)
....B
.....
A....
..... = 15 ways
Remember, this...
A Byte Saved is a Byte Earned
If you have been on PPCG for more than a couple of minutes you will probably have seen something that looks like this
12 bytes saved thanks to @expertgolfer
or something similar. Golfing here is not just competitive but also collaborative so users help each other...
Resolve paths code-golf
Convert a path to an absolute path. The path may be:
relative
absolute
contain ~
If the path doesn't exist, exit with code 1. An invalid path leads to undefined behavior. i.e. do whatever you want, I don't care
Test cases, assuming /foo/bar is the current working di...
Input consists of two positive integers, let's call them a and b for convenience.
Output is the list of prime numbers beginning with the ath prime and ending with the bth prime. If a and b are the same, then it means you should output only a single prime number.
The algorithm you use must sat...
def gen(number):
nr = sorted(number)
return "".join(nr) + "-" + "".join(reversed(nr))
def calc(number: object) -> object:
def f(x):
return 0 if x == 6174 else 1 + (lambda s: f(int(s[::-1]) - int(s)))("".join(sorted(str(x))))
print(f(3712))
total = 1
while True:
nr = numb...
200 rep for the shortest proper quine in 05AB1E
I am really bad at writing quines, so I'm willing to give rep for writing a quine in 05AB1E. There probably is a simple and easy solution that I am missing :p.
Since 05AB1E is a golfing language, I'm also interested in the shortest quine, so the ...
Help me cheat at Cheat
Cheat is a card game where you're trying to get rid of your hand. A turn looks something roughly like this:
Determine what card rank you have to play that turn. In most variants this is one rank higher than the previous turn.
Play 1-4 cards, face down. These don't have t...
Hey I have been reading about the tower of Hanoi online, and come across this algorithm.
for (x = 1; x < (1 << n); x++)
{
printf("\nMove from Peg %i to Peg %i", (x&x-1)%3+1, ((x|x-1)+1)%3+1);
}
which displays 2^n-1 moves for a standard puzzle. What confuses me is the algorithm used to fi...
200 for beating the existing winner of Shortest universal maze exit string
The current winner has an exit string of length 80. A valid answer including code and a resulting exit string of length 79 or shorter will win the bounty.
The bounty will be awarded to the best answer when no better answ...
