摘要：
题目很水，直接用Floyd即可/* * hdu3786/win.cpp * Created on: 2011-9-6 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>using namespace std;#define SIZE 100#define MAX 0x7fffffffint map[SIZE][SIZE];int N;void init() { int i, 阅读全文
摘要：
题目很简单，可是打了一个小时，这种题目真是悲剧啊/* * hdu3788/win.cpp * Created on: 2011-9-6 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 1010;bool judge(char *s, int len) { if (len < 3) { retur 阅读全文