<NOIP> 29 . P2089 烤鸡

题解:这是洛谷的第29道题目,我这的代码好若鸡。

源代码:

#include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>

using namespace std;

int main()
{
    bool flag = false;
    int iCounter = 0;
    int number,sum = 0;
    int *a = new int[10];
    cin >> number;

    for (size_t i1 = 1; i1 < 4; i1++)
        for (size_t i2 = 1; i2 < 4; i2++)
            for (size_t i3 = 1; i3 < 4; i3++)
                for (size_t i4 = 1; i4 < 4; i4++)
                    for (size_t i5 = 1; i5 < 4; i5++)
                        for (size_t i6 = 1; i6 < 4; i6++)
                            for (size_t i7 = 1; i7 < 4; i7++)
                                for (size_t i8 = 1; i8 < 4; i8++)
                                    for (size_t i9 = 1; i9 < 4; i9++)
                                        for (size_t i10 = 1; i10 < 4; i10++)
                                        {
                                            if (i1 + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + i10 == number)
                                            {
                                                sum++;
                                            }
                                        }

    cout << sum << endl;
    for (size_t i1 = 1; i1 < 4; i1++)
        for (size_t i2 = 1; i2 < 4; i2++)
            for (size_t i3 = 1; i3 < 4; i3++)
                for (size_t i4 = 1; i4 < 4; i4++)
                    for (size_t i5 = 1; i5 < 4; i5++)
                        for (size_t i6 = 1; i6 < 4; i6++)
                            for (size_t i7 = 1; i7 < 4; i7++)
                                for (size_t i8 = 1; i8 < 4; i8++)
                                    for (size_t i9 = 1; i9 < 4; i9++)
                                        for (size_t i10 = 1; i10 < 4; i10++)
                                        {
                                            if (i1 + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + i10 == number)
                                            {
                                                cout << i1 << " " << i2 << " " << i3 << " " << i4 << " " << i5 << " " << i6 << " " << i7 << " " << i8 << " " << i9 << " " << i10 << "\n";
                                            }
                                        }

    system("pause");
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值