求助,60分
  • 板块P1464 Function
  • 楼主BismarkSea
  • 当前回复2
  • 已保存回复2
  • 发布时间2023/7/16 23:04
  • 上次更新2023/11/3 09:26:11
查看原帖
求助,60分
669957
BismarkSea楼主2023/7/16 23:04

大佬帮忙看一看

#include <iostream>
long long f[21][21][21];
long long w(long long a, long long b, long long c) {
	
	if (f[a][b][c] != 0)return f[a][b][c];
	else if (a == 0 || b == 0 || c == 0)f[a][b][c] = 1;
	else if (a < b && b < c)f[a][b][c] = w(a, b, c - 1) + w(a, b - 1, c - 1) - w(a, b - 1, c);
	else f[a][b][c] = w(a - 1, b, c) + w(a - 1, b - 1, c) + w(a - 1, b, c - 1) - w(a - 1, b - 1, c - 1);
	return f[a][b][c];
}
int main(){
	using namespace std;
	long long a = 0, b = 0, c = 0;
	while (1) {
		cin >> a>>b>>c;
		if (a == -1&&b==-1&&c==-1)break;
		printf("w(%lld, %lld, %lld) = ",a, b, c);
		if (a < 0)a = 0; if (b < 0)b = 0; if (c < 0)c = 0;
		if (a > 20 || b > 20 || c >20) {a=20;b = 20; c = 20;}
		printf("%lld\n", w(a, b, c));
	}
	return 0;
}

2023/7/16 23:04
加载中...