JavaScript/Project-Euler/Problem015.js at master · Guduly/JavaScript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://projecteuler.net/problem=15
/* 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?
*/

// A lattice path is composed of horizontal and vertical lines that pass through lattice points.

exportconstlatticePath=(gridSize)=>{
letpaths
for(leti=1,paths=1;i<=gridSize;i++){
paths=paths*(gridSize+i)/i
}
// The total number of paths can be found using the binomial coefficient (b+a)/a.
returnpaths
}

// > latticePath(20))
// 137846528820