<reponame>mattnhb/exercises-and-whatsoever<filename>project-euler/exercise-15.py
# Starting in the top left corner of a 2×2 grid,
# and only being able to move to the right and down,
# there are exactly 6 routes to the bottom right corner.

# How many such routes are there through a 20×20 grid?
import math

print(math.comb(40, 20))

# https://en.wikipedia.org/wiki/Pascal's_triangle

# Starting in the top left corner of a 2×2 grid,
# and only being able to move to the right and down,
# there are exactly 6 routes to the bottom right corner.

# How many such routes are there through a 20×20 grid?
import math

print(math.comb(40, 20))

# https://en.wikipedia.org/wiki/Pascal's_triangle
# Starting in the top left corner of a 2×2 grid, # and only being able to move to the right and down, # there are exactly 6 routes to the bottom right corner. # How many such routes are there through a 20×20 grid? # https://en.wikipedia.org/wiki/Pascal's_triangle