Hi, ↵
I just wanted to know what is wrong with my recurrence for this question?↵
↵
problem link ==> https://codeforces.me/contest/678/problem/E↵
↵
my recurrence==>↵
↵
dp[mask] ==> The probability that the sith number one will win if anyone that is marked in the mask zero is dead and anyone that is alive are marked 1.↵
↵
so we only go through the mask and if the i-th one is 1 then res+= dp[mask&(1<<j)] and at the end we do res/(Count of the soldiers that are not dead).↵
↵
I know its completely wrong but I don't know why?↵
↵
and also please give me a correct recurrence and idea.↵
↵
Thanks in advance :(
I just wanted to know what is wrong with my recurrence for this question?↵
↵
problem link ==> https://codeforces.me/contest/678/problem/E↵
↵
my recurrence==>↵
↵
dp[mask] ==> The probability that the sith number one will win if anyone that is marked in the mask zero is dead and anyone that is alive are marked 1.↵
↵
so we only go through the mask and if the i-th one is 1 then res+= dp[mask&(1<<j)] and at the end we do res/(Count of the soldiers that are not dead).↵
↵
I know its completely wrong but I don't know why?↵
↵
and also please give me a correct recurrence and idea.↵
↵
Thanks in advance :(
