求助大佬,哪里RE
  • 板块P1464 Function
  • 楼主CPLQWERTY
  • 当前回复1
  • 已保存回复1
  • 发布时间2021/11/24 19:15
  • 上次更新2023/11/3 23:38:40
查看原帖
求助大佬,哪里RE
544977
CPLQWERTY楼主2021/11/24 19:15
#include <iostream>
using namespace std;
long long a, b, c;
long long f[30][30][30];
long long w(long long a, long long b, long long c) {
	if (a <= 0 || b <= 0 || c <= 0) return 1;
	if (f[a][b][c] != 0) return f[a][b][c];
	if (a > 20 || b > 20 || c > 20) return f[20][20][20];
	if (a < b && b < c) {
		if (f[a][b][c - 1] == 0) f[a][b][c - 1] = w(a, b, c - 1);
		if (f[a][b - 1][c - 1] == 0) f[a][b - 1][c - 1] = w(a, b - 1, c - 1);
		if (f[a][b - 1][c] == 0) f[a][b - 1][c] = w(a, b - 1, c);
		f[a][b][c] = f[a][b][c - 1] + f[a][b - 1][c - 1] - f[a][b - 1][c];
	} else {
		if (f[a - 1][b][c] == 0) f[a - 1][b][c] = w(a - 1, b, c);
		if (f[a - 1][b - 1][c - 1] == 0) f[a - 1][b - 1][c - 1] = w(a - 1, b - 1, c - 1);
		if (f[a - 1][b - 1][c] == 0) f[a - 1][b - 1][c] = w(a - 1, b - 1, c);
		if (f[a - 1][b][c - 1] == 0) f[a - 1][b][c - 1] = w(a - 1, b, c - 1);
		f[a][b][c] = f[a - 1][b][c] + f[a - 1][b - 1][c] + f[a - 1][b][c - 1] - f[a - 1][b - 1][c - 1];
	}
	return f[a][b][c];
}
int main () {
	while (1) {
		scanf("%lld%lld%lld", &a, &b, &c);
		if (a == -1 && b == -1 && c == -1) break;
		printf("w(%lld, %lld, %lld) = ", a, b, c);
		if (a > 20) a = 21;
		if (b > 20) b = 21;
		if (c > 20) c = 21;
		if(f[20][20][20] == 0) f[20][20][20] = w(20, 20, 20);
		printf("%lld\n", w(a, b, c));
		f[a][b][c] = w(a, b, c);
	}
	return 0;
}
2021/11/24 19:15
加载中...