研0 冲刺算法竞赛 day13 P2089 烤鸡

【算法1-3】暴力枚举 - 题单 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

思路:枚举搜索

代码:

#include<iostream>  
using namespace std;
int main()
{
    int a, b, c, d, e, f, g, h, i, j, in, x = 0;
    cin >> in;
    for (a = 1; a <= 3; a++)
    {
        for (b = 1; b <= 3; b++)
        {
            for (c = 1; c <= 3; c++)
            {
                for (d = 1; d <= 3; d++)
                {
                    for (e = 1; e <= 3; e++)
                    {
                        for (f = 1; f <= 3; f++)
                        {
                            for (g = 1; g <= 3; g++)
                            {
                                for (h = 1; h <= 3; h++)
                                {
                                    for (i = 1; i <= 3; i++)
                                    {
                                        for (j = 1; j <= 3; j++)
                                        {
                                            if (a + b + c + d + e + f + g + h + i + j == in)
                                            {
                                                x++;
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    cout << x << endl;
    for (a = 1; a <= 3; a++)
    {
        for (b = 1; b <= 3; b++)
        {
            for (c = 1; c <= 3; c++)
            {
                for (d = 1; d <= 3; d++)
                {
                    for (e = 1; e <= 3; e++)
                    {
                        for (f = 1; f <= 3; f++)
                        {
                            for (g = 1; g <= 3; g++)
                            {
                                for (h = 1; h <= 3; h++)
                                {
                                    for (i = 1; i <= 3; i++)
                                    {
                                        for (j = 1; j <= 3; j++)
                                        {
                                            if (a + b + c + d + e + f + g + h + i + j == in)
                                            {
                                                cout << a << " ";
                                                cout << b << " ";
                                                cout << c << " ";
                                                cout << d << " ";
                                                cout << e << " ";
                                                cout << f << " ";
                                                cout << g << " ";
                                                cout << h << " ";
                                                cout << i << " ";
                                                cout << j << endl;
                                            }
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
}

总结:

不能用数组记录,循环会将所有可能都过一遍,不能满足要求的“美味度”

  • 4
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值