Subtask#1 TLE求调
查看原帖
Subtask#1 TLE求调
124427
D_Chloroplast楼主2025/6/15 21:01
#include<bits/stdc++.h>
using namespace std;
long long w[21][21][21]={};
int main()
{
	int i,j,k,a,b,c,ans;
	for(i=0;i<=20;i++)
	{
		for(j=0;j<=20;j++)
		{
			w[0][i][j]=w[i][0][j]=w[i][j][0]=1;
		}
	}
	for(i=1;i<=20;i++)
	{
		for(j=1;j<=20;j++)
		{
			for(k=1;k<=20;k++)
			{
				if(i<j&&j<k)
				{
					w[i][j][k]=w[i][j][k-1]+w[i][j-1][k-1]-w[i][j-1][k];
					continue;
				}
				w[i][j][k]=w[i-1][j][k]+w[i-1][j-1][k]+w[i-1][j][k-1]-w[i-1][j-1][k-1];
			}
		}
	}
	while(1)
	{
		cin>>a>>b>>c;
		if(a==-1&&b==-1&&c==-1)
		{
			return 0;
		}
		if(a<=0||b<=0||c<=0)
		{
			cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<1<<endl;
			continue;
		}
		if(a>20||b>20||c>20)
		{
			cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<w[20][20][20]<<endl;
			continue;
		}
		cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<w[a][b][c]<<endl;
	}
}
2025/6/15 21:01
加载中...