Problem 15

This is a C++ solution to Project Euler problem 15 found at: https://projecteuler.net/problem=15

My Algorithm

For this question, we are asked to find the number of routes from the top left corner to the bottom right corner through a 20x20 grid. Using what we know about binomial coefficients, this question is quite simple. We can implement the algorithm found here: https://en.wikipedia.org/wiki/Binomial_coefficient to get our answer of 137846528820.

Problem 15 GitHub

Full Solution on GitHub

Problem 15 Solution