Punit1566's blog

An intersting OA question
By Punit1566, history, 118 minutes ago, In English

given n and k. there are total 10 groups and each group can have at most k value. So we have to find the number of ways that sum upto n . but each group has upper limit K.

here constraints are 1<=n,k<=1e9; n<=10*k

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
54 minutes ago, # |
  Vote: I like it +1 Vote: I do not like it

I see GE Vernova guys here.

→ Reply
  • »
    »
    29 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    ya it was asked in Ge Vernova . but i wanted to know how to solve it given the constraints.

    → Reply