# Answer to Question #44987 in Action Script | Flash | Flex | ColdFusion for ssss

Question #44987

Given a square maze (A) of dimension N, every entry (Aij) in the maze is either an open cell 'O' or a wall 'X'. A rat can travel to its adjacent locations (left, right, top and bottom), but to reach a cell, it must be open. Every cell in the maze will contain a survival probability P.

Your task is to find the number of ways to place maximum number of rats, such that they are not able to reach other and at the same time their minimum survival probability is at least PS. As the result can be long, take modulus of the result with 1000000007

Your task is to find the number of ways to place maximum number of rats, such that they are not able to reach other and at the same time their minimum survival probability is at least PS. As the result can be long, take modulus of the result with 1000000007

Expert's answer

#### Not answered

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert03.08.15, 16:33Dear visitor, please use panel for submitting new questions.

Raj Waykos03.08.15, 11:51In the Byteland country a string "S" is said to super ascii string if and only if count of each character in the string is equal to its ascii value.

In the Byteland country ascii code of 'a' is 1, 'b' is 2 ...'z' is 26.

Your task is to find out whether the given string is a super ascii string or not.

## Leave a comment