POJ3095 Linear Pachinko

 题目：http://acm.pku.edu.cn/JudgeOnline/problem?id=3095

 老虎机？子弹机？这是很有意思的一道模拟题...

 

1. import java.io.BufferedReader;
2. import java.io.IOException;
3. import java.io.InputStreamReader;
5. public class Main {
7.     public static void main(String[] args) throws IOException {
8.         BufferedReader read = new BufferedReader(new InputStreamReader(
9.                 System.in));
10.         String s;
11.         while (!(s = read.readLine()).equals("#")) {
12.             char[] c = s.toCharArray();
13.             int[] p = new int[c.length];
14.             for (int i = 0; i < c.length; i++) {
15.                 if (c[i] == '.') {
16.                     p[i] = 100;
17.                 } else if (c[i] == '_') {
18.                     p[i] = 0;
19.                 } else if (c[i] == '|') {
20.                     int k = 1;
21.                     while (true) {
22.                         if (i - k < 0) {
23.                             p[i] += 50;
24.                             break;
25.                         }
26.                         if (c[i - k] == '_') {
27.                             k++;
28.                             continue;
29.                         } else if (c[i - k] == '.' || c[i - k] == '/') {
30.                             p[i] += 50;
31.                             break;
32.                         } else if (c[i - k] == '|' || c[i - k] == '//') {
33.                             break;
34.                         }
35.                     }
36.                     k = 1;
37.                     while (true) {
38.                         if (i + k == c.length) {
39.                             p[i] += 50;
40.                             break;
41.                         }
42.                         if (c[i + k] == '_') {
43.                             k++;
44.                             continue;
45.                         } else if (c[i + k] == '.' || c[i + k] == '//') {
46.                             p[i] += 50;
47.                             break;
48.                         } else if (c[i + k] == '|' || c[i + k] == '/') {
49.                             break;
50.                         }
51.                     }
52.                 } else if (c[i] == '/') {
53.                     int k = 1;
54.                     while (true) {
55.                         if (i - k < 0) {
56.                             p[i] = 100;
57.                             break;
58.                         }
59.                         if (c[i - k] == '_') {
60.                             k++;
61.                             continue;
62.                         } else if (c[i - k] == '.' || c[i - k] == '/') {
63.                             p[i] = 100;
64.                             break;
65.                         } else if (c[i - k] == '|' || c[i - k] == '//') {
66.                             break;
67.                         }
68.                     }
69.                 } else if (c[i] == '//') {
70.                     int k = 1;
71.                     while (true) {
72.                         if (i + k == c.length) {
73.                             p[i] = 100;
74.                             break;
75.                         }
76.                         if (c[i + k] == '_') {
77.                             k++;
78.                             continue;
79.                         } else if (c[i + k] == '.' || c[i + k] == '//') {
80.                             p[i] = 100;
81.                             break;
82.                         } else if (c[i + k] == '|' || c[i + k] == '/') {
83.                             break;
84.                         }
85.                     }
86.                 }
87.             }
88.             int sum = 0;
89.             for (int i = 0; i < p.length; i++) {
90.                 sum += p[i];
91.             }
92.             System.out.println(sum / p.length);
93.         }
94.     }
95. }