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
-
given 3 sides, find area of this triangle
822 Solvers
-
Return unique values without sorting
1012 Solvers
-
Return elements unique to either input
812 Solvers
-
Set the array elements whose value is 13 to 0
1445 Solvers
-
Find and replaces spaces from a input string with *
172 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!