棰樼洰閾炬帴錛?a style="color: #6a3906; text-decoration: none;">http://poj.org/problem?id=1056榪欓亾棰樼敤瀛楀吀鏍戝彲鎺ワ紝鍏蜂綋鎬濊礬灝辨槸姣忛亣鍒頒竴涓崟璇嶉兘鎶婂畠鎻掑叆鍒板瓧鍏告爲涔嬩腑錛岀劧鍚庡鏋滈亣鍒頒簡9錛屽氨鏌ヨ姣忎釜鍗曡瘝鐨勮瘝灝炬爣璁扮殑鏁伴噺錛屽鏋滆瘝灝炬爣璁扮殑鏁伴噺澶氫簬1錛屽垯璇佹槑鍙﹀涓涓崟璇嶆槸榪欎釜鍗曡瘝鐨勫墠緙錛岃緭鍑哄け璐ワ紝鍚﹀垯鐨勮瘽杈撳嚭鎴愬姛銆?br />
view code
1 #include <iostream>
2 #include <cstdio>
3 #include <cstring>
4 #include <vector>
5 using namespace std;
6 struct trie{
7 int ch[110][2];
8 int val[100];
9 int sz;
10 void reset(){
11 sz = 1; memset(ch[0], 0, sizeof(ch[0]));
12 memset(val, 0, sizeof(val));
13 }
14 int idx(char c){
15 return c - '0';
16 }
17 void insert(string s, int v){
18 int u = 0, n = s.size();
19 for (int i = 0; i < n; i++){
20 int c = idx(s[i]);
21 if (!ch[u][c]){
22 memset(ch[sz], 0, sizeof(ch[sz]));
23 val[sz] = 0;
24 ch[u][c] = sz++;
25 }
26 u = ch[u][c];
27 }
28 val[u] = v;
29 }
30 bool query(string s, int v){
31 int u = 0, n = s.size(), cnt = 0;
32 for (int i = 0; i < n; i++){
33 int c = idx(s[i]);
34 u = ch[u][c];
35 if (val[u] == v) cnt += 1;
36 }
37 if (cnt > 1) return 0;
38 return 1;
39 }
40 };
41 trie t;
42 string s;
43 vector<string> v;
44 int main(){
45 t.reset();
46 int p = 1;
47 while (cin >> s){
48 if (s.compare("9") == 0){
49 printf("Set %d is ", p++);
50 bool f = 1;
51 for (int i = 0; i < v.size(); i++)
52 if (!t.query(v[i], -1)){
53 f = 0; break;
54 }
55 if (!f) printf("not ");
56 printf("immediately decodable\n");
57 t.reset();
58 v.clear();
59 }
60 else{
61 v.push_back(s);
62 t.insert(s, -1);
63 }
64 }
65 return 0;
66 }
67 
]]>