本文共 1152 字，大约阅读时间需要 3 分钟。
数据量很少，暴搜就可以过了
/* * hdu1181/win.cpp * Created on: 2012-7-30 * Author : ben */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;const int MAXN = 26;bool mymap[MAXN][MAXN], visited[MAXN];bool dfs(int s, int e) { if(mymap[s][e]) { return true; } for(int i = 0; i < MAXN; i++) { if(i != s && mymap[s][i] && !visited[i]) { visited[i] = true; if(dfs(i, e)) { return true; } } } return false;}int main() {#ifndef ONLINE_JUDGE freopen("data.in", "r", stdin);#endif char str[200]; int a, b; memset(mymap, false, sizeof(mymap)); while(scanf("%s", str) != EOF) { if(strcmp(str, "0") == 0) { memset(visited, false, sizeof(visited)); visited[1] = true; if(dfs(1, 12)) { puts("Yes."); }else { puts("No."); } memset(mymap, false, sizeof(mymap)); }else { a = str[0] - 'a'; b = strlen(str); b = str[b - 1] - 'a'; mymap[a][b] = true; } } return 0;}
转载于:https://www.cnblogs.com/moonbay/archive/2012/07/30/2615439.html