selfcompiler's blog

Topcoder Problem
By selfcompiler, 10 years ago, In English

I tried this Problem then i am able to get the dp relation dp[i][k]=(1/(i+1))*dp[i-1][k]+(i/(i+1))*dp[i-1][k-1] where dp[i][k] represent the probability of collection of k candies in first i bags . But here the value of N is very high so i am unable to solve it,that will be great help,Thanks in advance

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
10 years ago, # |
  Vote: I like it -36 Vote: I do not like it

Please even once vote up my comment ! I'd be happy.

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Did you by any chance go through the TC forum to check if a solution/editorial had been posted?

→ Reply
»
10 years ago, # |
  Vote: I like it +7 Vote: I do not like it

http://codeforces.me/blog/entry/13381

→ Reply