Company: Samsung_18sep
Difficulty: medium
Dr. Jang's Division Visit Probability Problem Description Our freaky Dr. Jang spends the whole day visiting all divisions and solving problems they are faced with. Dr. Jang has his own philosophy: Spend exactly no more than 10 minutes in each division. He might stay for a while in one division, but in that case, his visit extends on a 10-minute basis. A probabilistic graph on Dr. Jang's movement is given. Below is one example: Dr. Jang stays for the first 10 minutes in division 1, moves to division 2 with the probability of 0.3 and spends the next 10 minutes, or he moves to division 3 with the probability of 0.7 and spends the next 10 minutes. Do not consider the time it takes to move between divisions. There can be several arrows that come from one division, but the sum of the probabilities, written on them, must always be 1. The division Dr. Jang visits first after he gets to work in the morning is always division 1. Write a program that finds the division with the highest probabilit