Hey guys ,
I am trying to solve a simple DP problem :
http://community.topcoder.com/stat?c=problem_statement&pm=10033 SRM 422
division 2 level 2.
I have derived a recurrence for prime scores of player A like this
a[i][j] = 0 if i<j
pow(p,i) if i==j
(~p) * a[i-1][j] + p * a[i][j-1]
where i : interval (max 18 ) , j : sum ( max 18)
Now after populating entries in this matrix , for each prime score : 2 , 3
, 5 ... so on upto 17 i find the probability of A for all possible prime
scores.
I am not saying that this recurrence is to solve this problem.
Can someone please tell me if this recurrence is right or not ?
--
Mohit
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
