Example:A person can reach 1st floor in only 1 way, 2nd floor in 2 ways, 3rd floor in 4 ways and 4th floor in 7 ways.
Using recursive calls i got answer as 927 but there is no such option.
1023
734
827
69
2026-04-01 20:26:58.1775075218
A person can climb to a nth floor in steps of 1, 2 or 3. Count number of ways a person can reach 12th floor.
743 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
I got 927 with the following SQL run on MS SQL server
that is to say, I arranged all combinations of 0,1,2, or 3 steps 12 times, and selected combinations that add up to 12 - then I stripped out all countings of zero steps, leaving me with every permutation that adds to 12, e.g 33312 - then I listed the distinct values (1 row per unique occurrence) - that gave me 927 on my screen grid-view
I'm not looking for any BA or anything, this was too big for a comment.