洛谷 P2089 烤鸡

感觉没啥好写的，直接上代码吧

代码

#include<iostream>
using namespace std;
#define SIZE 60000

int scheme[SIZE][10];//用来保存方案的

void result(int n)
{
	if (n > 30 || n < 10)//很明显可以知道n的取值范围，故可以排除超出范围的取值
	{
		cout << 0;
		return;
	}
	int num = 0;
	for (int a = 1; a <= 3; a++)//通过循环嵌套来实现字典排序
	{
		for (int b = 1; b <= 3; b++)
		{
			for (int c = 1; c <= 3; c++)
			{
				for (int d = 1; d <= 3; d++)
				{
					for (int e = 1; e <= 3; e++)
					{
						for (int f = 1; f <= 3; f++)
						{
							for (int g = 1; g <= 3; g++)
							{
								for (int h = 1; h <= 3; h++)
								{
									for (int i = 1; i <= 3; i++)
									{
										for (int j = 1; j <= 3; j++)
										{
											if (a + b + c + d + e + f + g + h + i + j == n)//如果美味程度满足的话，保存该方案
											{
												scheme[num][0] = a;
												scheme[num][1] = b;
												scheme[num][2] = c;
												scheme[num][3] = d;
												scheme[num][4] = e;
												scheme[num][5] = f;
												scheme[num][6] = g;
												scheme[num][7] = h;
												scheme[num][8] = i;
												scheme[num][9] = j;
												num++;
											}
										}
									}
								}
							}
						}
					}
				}
			}
		}
	}
	cout << num << endl;
	for (int l = 0; l < num; l++)
	{
		for (int m = 0; m < 10; m++)
		{
			cout << scheme[l][m] << " ";
		}
		cout << endl;
	}
}

int main()
{
	int n;//美味程度
	cin >> n;
	result(n);

	return 0;
}