Consider the integer triangle below:
It follows the same rule as Pascal's Triangle, except that instead of affixing 1's at the sides of each row, the row number minus 1, is affixed (on first row 0 is affixed; at row 2, 1 is affixed on each side, etc.). Any inner number, as in Pascal's Triangle, is the sum of the left and right numbers on its previous row.
Given a number n find
, which is the sum of the n-th row. Hence,
and
.
We could be getting large numbers here, therefore please concatenate the total number of digits with the last 3 digits of
and output a single concatenated integer. For example the
, hence the output should be
.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
483 Solvers
-
1069 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2114 Solvers
-
114 Solvers
-
Large Sum (inspired by Project Euler 13)
116 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!