|
| 1 | +import java.io.BufferedReader; |
| 2 | +import java.io.IOException; |
| 3 | +import java.io.InputStreamReader; |
| 4 | +import java.util.StringTokenizer; |
| 5 | + |
| 6 | +public class SB_1405 { |
| 7 | + static int N; |
| 8 | + static int[] dx = {0, 0, 1, -1}; // 동, 서, 남, 북 |
| 9 | + static int[] dy = {1, -1, 0, 0}; |
| 10 | + static double[] prob = new double[4]; |
| 11 | + static boolean[][] visited = new boolean[30][30]; |
| 12 | + static double ans = 0; |
| 13 | + |
| 14 | + private static void dfs(int x, int y, int depth, double total) { |
| 15 | + if (depth==N) { |
| 16 | + ans += total; |
| 17 | + return; |
| 18 | + } |
| 19 | + |
| 20 | + for (int i = 0; i < 4; i++) { |
| 21 | + int nx = x + dx[i]; |
| 22 | + int ny = y + dy[i]; |
| 23 | + if (!visited[nx][ny]){ // 방문하지 않은 곳이라면 |
| 24 | + visited[nx][ny] = true; |
| 25 | + dfs(nx, ny, depth+1, total*prob[i]); |
| 26 | + visited[nx][ny] = false; |
| 27 | + } |
| 28 | + } |
| 29 | + } |
| 30 | + |
| 31 | + public static void main(String[] args) throws IOException { |
| 32 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 33 | + StringTokenizer st = new StringTokenizer(br.readLine()); |
| 34 | + |
| 35 | + N = Integer.parseInt(st.nextToken()); |
| 36 | + for (int i = 0; i < 4; i++) { |
| 37 | + prob[i] = Integer.parseInt(st.nextToken())*0.01; // 확률로 표현 |
| 38 | + } |
| 39 | + |
| 40 | + visited[15][15] = true; |
| 41 | + dfs(15, 15, 0, 1); |
| 42 | + System.out.println(ans); |
| 43 | + } |
| 44 | +} |
0 commit comments