HDU - 2069 - Coin Change

HDU - 2069 - Coin Change

第一次了解暴力+打表 = = 确实很神奇

题目

欧米茄

解题过程

暴力枚举

一开始把暴力枚举的层次搞反了,不出所料Wa了。。。
搞对就好啦!

暴力打表

看到居然有人直接打表完放到一个数组里,,不过确实好机智呀,代码运行还很快!

Ac代码

还是先把才开始错误的贴一下吧

// 2069 - Coin Change

int main() {
    int n, sum;
    while (scanf("%d", &n) !=EOF && n != -1) {
        sum = 0;
        if (!n) {
            printf("1\n");
        } else {
            for (int i = 0; i <= n / 50; i++) {
                for (int j = 0; j <= (n - 50 * i) / 25; j++) {
                    for (int k = 0; k <= (n - 50 * i - 25 * j) / 10; k++) {
                        for (int l = 0; l <= (n - 50 * i - 25 * j - 10 * k) / 5; l++) {
                            if (i + j + k + l + (n - 50 * i - 25 * j - 10 * k - 5 * l) <= 100) {
                                sum++;
                            }
                        }
                    }
                }
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

暴力枚举

// 2069 - Coin Change

int main() {
    int n, sum;
    while (scanf("%d", &n) !=EOF && n != -1) {
        sum = 0;
        if (!n) {
            printf("1\n");
        } else {
            for (int i = n / 50; i >= 0; i--) {
                for (int j = (n - 50 * i) / 25; j >= 0; j--) {
                    for (int k = (n - 50 * i - 25 * j) / 10; k >= 0; k--) {
                        for (int l = (n - 50 * i - 25 * j - 10 * k) / 5; l >= 0; l--) {
                            if (i + j + k + l + (n - 50 * i - 25 * j - 10 * k - 5 * l) <= 100) {
                                sum++;
                            }
                        }
                    }
                }
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

神奇的暴力打表

// 2069 - Coin Change

#include <stdio.h>
int a[] = {
1,1,1,1,1,2,2,2,2,2,4,
4,4,4,4,6,6,6,6,6,9,
9,9,9,9,13,13,13,13,13,18,
18,18,18,18,24,24,24,24,24,31,
31,31,31,31,39,39,39,39,39,50,
50,50,50,50,62,62,62,62,62,77,
77,77,77,77,93,93,93,93,93,112,
112,112,112,112,134,134,134,134,134,159,
159,159,159,159,187,187,187,187,187,218,
218,218,218,218,252,252,252,252,252,292,
291,291,291,291,333,333,333,333,332,380,
380,380,379,378,430,430,429,428,427,485,
484,483,482,482,544,543,542,541,539,608,
607,606,604,602,677,676,673,671,670,751,
748,746,744,743,828,825,823,822,818,912,
910,908,904,900,1001,999,995,990,986,1098,
1093,1088,1084,1081,1196,1191,1186,1182,1177,1301,
1296,1292,1285,1278,1413,1408,1400,1393,1387,1532,
1524,1515,1508,1503,1654,1644,1637,1631,1622,1782,
1773,1766,1757,1746,1916,1909,1898,1886,1875,2061,
2049,2037,2025,2015,2208,2194,2181,2170,2156,2361,
2348,2336,2321,2306,2521,2508,2492,2475,2459,2691,
2673,2654,2637,2622,2863,2843,2824,2808,2789,3042,
3021,3004,2983,2960,3228,3209,3187,3164,3140,3424,
3401,3376,3351,3329,3623,3596,3570,3545,3517,3830
};
int main() {
    int money;
    while (scanf("%d", &money)!=EOF) {
        printf("%d\n",a[money]);
    }
    return 0;
}

说实话,真的好暴力= =

小结

没啥,知道了个暴力打表还挺好玩!

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值