Qualified's blog

By Qualified, history, 7 weeks ago, In English

Recently, I stumbled upon Rascal's Triangle. You can read more about it here. Basically it is very like Pascal's Triangle but a bit different. I know that there is a $$$O(n)$$$ solution for Pascal's Triangle. I would want to calculate the $$$nth$$$ row in $$$O(n)$$$ mod $$$998244353$$$. Help?

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Qualified (previous revision, new revision, compare).

»
7 weeks ago, # |
  Vote: I like it +25 Vote: I do not like it

Isn't it just $$$k(n - k) + 1$$$ for the $$$n$$$-th row and $$$k$$$-th column?

  • »
    »
    7 weeks ago, # ^ |
    Rev. 2   Vote: I like it -19 Vote: I do not like it

    Is the first row the 0-th row or the 1st row and is the first column the 0-th column or the 1st column?