Project Euler > Problem 15 > Lattice paths (Java Solution)


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?



The solution may include methods that will be found here: .

public interface EulerSolution{

public String run();

 * Solution to Project Euler problem 15
 * By Nayuki Minase

public final class p015 implements EulerSolution {
 public static void main(String[] args) {
  System.out.println(new p015().run());
 public String run() {
  return Library.binomial(40, 20).toString();

No comments :

Post a Comment

Follow Me

If you like our content, feel free to follow me to stay updated.


Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?


Copyright © 2012 - 2014 Java Problems  --  About  --  Attribution  --  Privacy Policy  --  Terms of Use  --  Contact