POJ-1840（解五元三次方程-hash）

a1x1³+ a2x2³+ a3x3³+ a4x4³+ a5x5³=0 转换为-（a1x1³+ a2x2³） =  a3x3³+ a4x4³+ a5x5³

直接数组模拟，数组开short

short hash[50 * 50 * 50 * 50 * 4 + 1];
int main()
{
	int a, b, c, d, e;
	int i, j, k, l, m;
	while (scanf("%d%d%d%d%d", &a, &b, &c, &d, &e) == 5) {
		int ans = 0;
		memset(hash, 0, sizeof(hash));
		for (i = -50; i <= 50; ++i) {
			for (j = -50; j <= 50; ++j) {
				if (i == 0 || j == 0) continue;
				int sum = (i * i * i * a + j * j * j * b) * (-1);
				if (sum < 0) sum += 50 * 50 * 50 * 50 * 4;
				hash[sum]++;
			}
		}
		for (i = -50; i <= 50; ++i) {
			for (j = -50; j <= 50; ++j) {
				for (k = -50; k <= 50; ++k) {
					if (i == 0 || j == 0 || k == 0) continue;
					int sum = i * i * i * c + j * j * j * d + k * k * k * e;
					if (sum < 0) sum += 50 * 50 * 50 * 50 * 4;
					if (sum > 50 * 50 * 50 * 50 * 4) break;
					ans += hash[sum];
				}
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}