uva 188(哈希)

题意：题目不太好懂，按题意模拟找到最小的c，c是w[]的倍数，又因为把w[]排序后w[0]最小，所以c从w[0]开始赋值。

题解：用不到哈希，按题意直接递归就行了。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 300;

char str[N];
int w[N];
int n, c;

void init() {
	n = 0;
	memset(w, 0, sizeof(w));
}

void solve() {
	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++)
			if (c / w[i] % n == c / w[j] % n) {
				c = (c / w[i] + 1) * w[i] < (c / w[j] + 1) * w[j] ? (c / w[i] + 1) * w[i] : (c / w[j] + 1) * w[j];
				solve();
				return;
			}
}

int main() {
	while (gets(str)) {
		init();
		for (int i = 0; i < strlen(str); i++)
			if (str[i] >= 'a' && str[i] <= 'z')
				w[n] = (w[n] << 5) + str[i] - 'a' + 1;
			else {
				n++;
				while (str[i + 1] == ' ')
					i++;
			}
		n++;
		sort(w, w + n);
		c = w[0];
		solve();
		puts(str);
		printf("%d\n\n", c);
	}
	return 0;
}