<NOIP> 29 . P2089 烤鸡

来源:互联网 发布:旅游saas平台源码 编辑:程序博客网 时间:2024/05/02 02:24

题解:这是洛谷的第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;}